
doi: 10.1007/bfb0120940
This paper presents a mathematical formulation and a solution technique for a class of traffic scheduling problems. Each problem in this class is characterized by a company-owned fleet of tractors and trailers, a calendar of shipments to be made during a specified scheduling period, and an option to contract any shipment to an independent hauler.
Applications of mathematical programming, Benders decomposition algorithm, Deterministic scheduling theory in operations research, mathematical formulation, routing, transportation fleet management, Deterministic network models in operations research, Integer programming, solution technique, network applications, traffic scheduling
Applications of mathematical programming, Benders decomposition algorithm, Deterministic scheduling theory in operations research, mathematical formulation, routing, transportation fleet management, Deterministic network models in operations research, Integer programming, solution technique, network applications, traffic scheduling
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
