Approximating reduced costs under degeneracy in a network flow problem with side constraints

DOI<267::AID-NET2>3.0.CO;2-E 10.1002/(SICI)1097-0037(199607)27:4<267::AID-NET2>3.0.CO;2-EzbMath0865.90044OpenAlexW2078775156MaRDI QIDQ5689761

Shangyao Yan

Publication date: 7 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199607)27:4<267::aid-net2>3.0.co;2-e

zbMATH Keywords

Lagrangian relaxationdegeneracyshortest path algorithmoptimal simplex tableaunetwork flow problems with side constraintsminimum-cost network flow algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (6)

Optimal construction of airline individual crew pairings. ⋮ Sensitivity analysis of the optimal assignment. ⋮ An optimization model and a solution algorithm for the many-to-many car pooling problem ⋮ SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM ⋮ A passenger demand model for airline flight scheduling and fleet routing ⋮ Global and local search algorithms for concave cost transshipment problems

This page was built for publication: Approximating reduced costs under degeneracy in a network flow problem with side constraints