An approximative algorithm for the fixed-charges transportation problem

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

William Baumol, Harold W. Kuhn

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 approximative algorithm for the fixed charge problem, Linear-Time Approximation for Maximum Weight Matching, The transportation problem with packing constraints, On the fixed cost flow problem†, A heuristic algorithm for the fixed charge problem, A systematic extreme point enumeration procedure for fixed charge problem, An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow, Degeneracy in fixed cost transportation problems, 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, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, On the use of tree indexing methods in transportation algorithms, Probabilistic local search algorithms for concave cost transportation network problems, COLE: a new heuristic approach for fixed charge problem computational results, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure, An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem, A set covering reformulation of the pure fixed charge transportation problem, Global and local search algorithms for concave cost transshipment problems, A tabu search heuristic procedure for the fixed charge transportation problem, The pure fixed charge transportation problem