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

DOI10.1016/0377-2217(84)90015-8zbMATH Open0536.90061OpenAlexW2037942733MaRDI QIDQ792216FDOQ792216

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

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

Recommendations

• A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
• A relaxation-strategy-based modification branch-and-bound algorithm for solving a class of transportation-production problems
• A new algorithm for the quasi-assignment problem
• Improving techniques for transportation problems
• On some matching problems arising in vehicle scheduling models

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)

Cites Work

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

Cited In (2)

• Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
• Some new results on the algebraic characterizations of an equality constrained optimization problem equivalent to the transportation problem

This page was built for publication: An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792216)