Supernode processing of mixed-integer models

DOI10.1007/BF01299207zbMath0819.90065OpenAlexW2092128803MaRDI QIDQ1342883

Ralf Szymanski, Uwe H. Suhl

Publication date: 9 February 1995

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

large scale mixed-integer optimizationpreprocessing of integer models

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11)

Related Items

Progress in presolving for mixed integer programming ⋮ Complexity evaluation of benchmark instances for the \(p\)-median problem ⋮ Two-row and two-column mixed-integer presolve using hashing-based pairing methods ⋮ Presolve Reductions in Mixed Integer Programming

Uses Software

• MOPS

Cites Work

• Unnamed Item
• Unnamed Item
• Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
• Strong formulations for mixed integer programming: A survey
• A fast LU update for linear programming
• MOPS -- Mathematical optimization system
• Efficient reformulation for 0-1 programs -- methods and computational results
• Degree-two Inequalities, Clique Facets, and Biperfect Graphs
• Solving large-scale mixed-integer programs with fixed charge variables
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation