An approximative algorithm for the fixed charge problem
From MaRDI portal
Publication:5580061
DOI10.1002/nav.3800160311zbMath0186.24102OpenAlexW1583504892MaRDI QIDQ5580061
Publication date: 1969
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800160311
Related Items
The fixed charge problem, The fractional fixed-charge problem, Computational risk management techniques for fixed charge network flow problems with uncertain arc failures, A heuristic algorithm for the fixed charge problem, A vertex ranking algorithm for the fixed-charge transportation problem, Degeneracy in fixed cost transportation problems, Algorithms for the single-source uncapacitated minimum concave-cost network flow problem, Quasi-concave minimization subject to linear constraints, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Exact algorithm for solving a special fixed-charge linear programming problem, COAL: A new heuristic approach for solving the fixed charge problem - computational results, A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production, Unnamed Item, 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, Fixed charge problems with identical fixed charges, Fractional polynomial bounds 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
Cites Work
