Marquez Diez-Canedo, Javier; Medina-Mora Escalante, Oscar A network solution to a general vehicle scheduling problem. (English) Zbl 0366.90058 Eur. J. Oper. Res. 1, 255-261 (1977). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 Documents MSC: 90B10 Deterministic network models in operations research 90B35 Deterministic scheduling theory in operations research 90C35 Programming involving graphs or networks 90B20 Traffic problems in operations research 90C05 Linear programming × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Bellmore, M.; Bennington, G.; Lubore, S., A maximum utility solution to a vehicle constrained tanker scheduling problem, Naval Res. Logistics Quart., 15, 3 (1968) [2] Dantzig, G. B.; Fulkerson, D. R., Minimizing the number of tankers to meet a fixed schedule, Naval Res. Logistics Quart., 1, 215-222 (1954) · Zbl 0072.37802 [3] Ford, L. R.; Fulkerson, D. R., Flows in Networks (1962), Princeton University Press: Princeton University Press NJ · Zbl 0139.13701 [4] Forrest, J. J.H.; Hirst, J. P.H.; Tomlin, J. A., Practical solution to large mixed integer programming problems with UMPIRE, Management Sci., 20, 5 (1974) · Zbl 0304.90079 [5] Garfinkel, R. S.; Nemhauser, G. L., Integer Programming (1972), John Wiley: John Wiley NY · Zbl 0271.90028 [6] Hitch, C. J., Planning the composition of an air transport fleet, case study C, (Hanssmann, F., Operations Research Techniques for Capital Investment (1968), John Wiley: John Wiley NY) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.