COAL: A new heuristic approach for solving the fixed charge problem - computational results
From MaRDI portal
Publication:2277365
DOI10.1016/0377-2217(91)90084-9zbMath0725.90070MaRDI QIDQ2277365
Christoph Haehling von Lanzenauer, Don D. Wright
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90084-9
65K05: Numerical mathematical programming methods
90C11: Mixed integer programming
90B80: Discrete location and assignment
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
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, Fractional polynomial bounds for the fixed charge problem, COLE: a new heuristic approach for fixed charge problem computational results, Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem
Cites Work
- A Lagrangean dual ascent algorithm for simple plant location problems
- Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
- A branch-and-bound algorithm for solving fixed charge problems
- An integer programming algorithm for portfolio selection with fixed charges
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- A SIMPLEX PROCEDURE FOR A FIXED CHARGE PROBLEM
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Multicommodity Distribution System Design by Benders Decomposition
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
- Parametric Mixed Integer Programming: An Application to Solid Waste Management
- Concave minimization over a convex polyhedron
- The fixed charge problem
- An approximative algorithm for the fixed charge problem
- The fixed charge problem
