Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics

DOI10.1016/0377-2217(89)90441-4zbMath0679.90045OpenAlexW2001614877MaRDI QIDQ1823143

Don D. Wright, Christoph Haehling von Lanzenauer

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90441-4

zbMATH Keywords

Lagrangian relaxationheuristiccost allocationcomputational resultslarge general fixed charge problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11)

Related Items

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation ⋮ Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach ⋮ On solving the continuous data editing problem ⋮ Matheuristics: survey and synthesis ⋮ 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 ⋮ Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics ⋮ A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ A tabu search heuristic procedure for the fixed charge transportation problem

Cites Work

• Unnamed Item
• Heuristics and their design: A survey
• Locational analysis
• 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
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• Worst-Case Analysis of Heuristic Algorithms
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
• Multicommodity Distribution System Design by Benders Decomposition
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• An approximate solution method for the fixed charge problem
• The fixed charge problem
• The fixed charge problem