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

DOI10.1007/BF01586089MaRDI QIDQ3680611zbMATH OpenOpenAlexFDO

Authors 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

fixed charge variableslarge-scale mixed-integer programmingpreprocessing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4001344
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• OPTIMIZING CHEMICAL PLANT OPERATION BY MIXED INTEGER PROGRAMMING
• Supernode processing of mixed-integer models

Cites work

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

Cited in

(11)

• An algorithm for solving large capacitated warehouse location problems
• Solving to optimality the uncapacitated fixed-charge network flow problem
• Supernode processing of mixed-integer models
• Efficient reformulation for 0-1 programs -- methods and computational results
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
• A global optimization point of view to handle non-standard object packing problems
• A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings
• The interactive fixed charge linear programming problem
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
• An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680611)