An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems

DOI10.1016/0377-2217(84)90015-8zbMath0536.90061OpenAlexW2037942733MaRDI QIDQ792216

Fred Glover, Nancy V. Phillips, Darwin D. Klingman

Publication date: 1984

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

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

zbMATH Keywords

relaxationtransportation schedulingprimal simplex algorithmalternating path basis structurebipartite weighted matching

Mathematics Subject Classification ID

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

Related Items

Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem

Cites Work

• An improvement in the Gavish-Shlifer algorithm for a class of transportation scheduling problems
• The generalized alternating path algorithm for transportation problems
• An approach for solving a class of transportation scheduling problems
• A polynomially bounded algorithm for a singly constrained quadratic program
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Pivot Strategies for Primal-Simplex Network Codes
• The alternating basis algorithm for assignment problems
• The lower bounded and partial upper bounded distribution model
• The traveling-salesman problem and minimum spanning trees: Part II
• Unnamed Item
• Unnamed Item