An approximative algorithm for the fixed-charges transportation problem

DOI10.1002/nav.3800090102zbMath0109.13903MaRDI QIDQ3845817

Harold W. Kuhn, William Baumol

Publication date: 1962

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800090102

zbMATH Keywords

applications of probability theory and statistics

Related Items

An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow, An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem, An approximative algorithm for the fixed charge problem, On the fixed cost flow problem†, Global and local search algorithms for concave cost transshipment problems, On the use of tree indexing methods in transportation algorithms, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, A set covering reformulation of the pure fixed charge transportation problem, A tabu search heuristic procedure for the fixed charge transportation problem, Probabilistic local search algorithms for concave cost transportation network problems, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, A heuristic algorithm for the fixed charge problem, A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems, Adaptive dynamic cost updating procedure for solving fixed charge network flow problems, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, COLE: a new heuristic approach for fixed charge problem computational results, The pure fixed charge transportation problem, A systematic extreme point enumeration procedure for fixed charge problem, Degeneracy in fixed cost transportation problems