A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems

DOI10.1016/0305-0548(90)90023-ZzbMath0681.90061MaRDI QIDQ1823858

Cliff T. Ragsdale, Patrick G. McKeown

Publication date: 1990

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound; heuristic; computational results; additional constraints; data preprocessing; fixed charge problem

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C11: Mixed integer programming

Related Items

Deriving conclusions in expert systems when knowledge is incomplete, A tabu search heuristic procedure for the fixed charge transportation problem, Incumbent solutions in branch-and-bound algorithms: Setting the record straight, On solving the continuous data editing problem, Tabu search applied to the general fixed charge problem, COLE: a new heuristic approach for fixed charge problem computational results, An algorithm for solving fixed-charge problems using surrogate constraints

Cites Work

• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics
• A branch-and-bound algorithm for solving fixed charge problems
• The interactive fixed charge linear programming problem
• Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem
• Concave minimization over a convex polyhedron
• The fixed charge problem