An improvement in the Gavish-Shlifer algorithm for a class of transportation scheduling problems

DOI10.1016/0377-2217(82)90072-8zbMath0473.90054OpenAlexW2067755172MaRDI QIDQ1159133

Gregory P. White

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90072-8

zbMATH Keywords

maximum matchingcomputational resultsimprovementtransportation schedulingdelivery problemGavish-Shlifer algorithmschool bus problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (2)

The school bus routing problem: a review ⋮ An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems

Cites Work

• An approach for solving a class of transportation scheduling problems
• The traveling-salesman problem and minimum spanning trees: Part II
• Unnamed Item

This page was built for publication: An improvement in the Gavish-Shlifer algorithm for a class of transportation scheduling problems