Solving large-scale mixed-integer programs with fixed charge variables

DOI10.1007/BF01586089zbMath0565.90049OpenAlexW2004767295MaRDI QIDQ3680611

Uwe H. Suhl

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01586089

zbMATH Keywords

preprocessingfixed charge variableslarge-scale mixed-integer programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11)

Related Items (7)

Supernode processing of mixed-integer models ⋮ An algorithm for solving large capacitated warehouse location problems ⋮ An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems ⋮ A global optimization point of view to handle non-standard object packing problems ⋮ Efficient reformulation for 0-1 programs -- methods and computational results ⋮ Solving to optimality the uncapacitated fixed-charge network flow problem ⋮ Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints

Cites Work

• Formal optimization of some reduced linear programming problems
• A branch-and-bound algorithm for solving fixed charge problems
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Experiments in mixed-integer linear programming using pseudo-costs
• The Extended Control Language of MPSX/370 and possible applications
• Experiments in mixed-integer linear programming

This page was built for publication: Solving large-scale mixed-integer programs with fixed charge variables