An algorithm for solving fixed-charge problems using surrogate constraints

DOI10.1016/0305-0548(91)90045-SzbMath0717.90052MaRDI QIDQ2638935

Patrick G. McKeown, Cliff T. Ragsdale

Publication date: 1991

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

zbMATH Keywords

set covering; branch-and- bound; surrogate constraints; fixed-charge problems

Mathematics Subject Classification ID

90C11: Mixed integer programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge

Cites Work

• Unnamed Item
• Experiments in integer programming
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
• A branch-and-bound algorithm for solving fixed charge problems
• Solving Large-Scale Zero-One Linear Programming Problems
• Valid Linear Inequalities for Fixed Charge Problems
• Error Localization for Erroneous Data: Continuous Data, Linear Constraints
• An easy solution for a special class of fixed charge problems
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• 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
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Concave minimization over a convex polyhedron
• A Mathematical Programming Approach to Editing of Continuous Survey Data
• The fixed charge problem