Fractional polynomial bounds for the fixed charge problem
From MaRDI portal
Publication:2342141
DOI10.1007/s10957-013-0437-yzbMath1320.90048MaRDI QIDQ2342141
Veena G. Adlakha, Krzysztof Kowalski
Publication date: 11 May 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0437-y
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Cites Work
- Two classical transportation problems revisited: pure constant fixed charges and the paradox
- Heuristic algorithms for the fixed-charge transportation problem
- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
- A vertex ranking algorithm for the fixed-charge transportation problem
- The fixed charge problem. I: A new heuristic method
- A tabu search heuristic procedure for the fixed charge transportation problem
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
- Algorithms for solving the single-sink fixed-charge transportation problem
- COLE: a new heuristic approach for fixed charge problem computational results
- Fixed-cost transportation problems
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- An approximate solution method for the fixed charge problem
- The fixed charge problem
- An approximative algorithm for the fixed charge problem
- The fixed charge problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem