A vertex ranking algorithm for the fixed-charge transportation problem

DOI10.1007/BF00934768MaRDI QIDQ1151821zbMATH OpenOpenAlexFDO

Authors 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

distribution problemsnonconvex problemstransportation 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)

Cites work

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

Cited in

(9)

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

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

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