A vertex ranking algorithm for the fixed-charge transportation problem

DOI10.1007/BF00934768zbMath0458.90041OpenAlexW1966116807MaRDI QIDQ1151821

S. H. Smith

Publication date: 1982

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934768

zbMATH Keywords

transportation problemsnonconvex problemsdistribution problemsBalinski's approximation schemeepsilon-optimal solutionfixed charge problemsimproved lower boundMurty's extreme point ranking schemevertex ranking algorithm

Mathematics Subject Classification ID

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

Related Items (9)

On lower bounds for the fixed charge problem ⋮ A heuristic algorithm for the fixed charge problem ⋮ Maximizing strictly convex quadratic functions with bounded perturbations ⋮ Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria ⋮ Solving fixed charge transportation problem with interval parameters ⋮ Heuristic algorithms for the fixed-charge transportation problem ⋮ Fractional polynomial bounds for the fixed charge problem ⋮ An algorithm for finding the optimum solution of solid fixed-charge transportation problem ⋮ An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem

Cites Work

• Fixed-cost transportation problems
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
• An approximate solution method for the fixed charge problem
• An approximative algorithm for the fixed charge problem
• The fixed charge problem
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• Solving the Fixed Charge Problem by Ranking the Extreme Points

This page was built for publication: A vertex ranking algorithm for the fixed-charge transportation problem