Supernode processing of mixed-integer models
From MaRDI portal
(Redirected from Publication:1342883)
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3598222 (Why is no real title available?)
- A fast LU update for linear programming
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Efficient reformulation for 0-1 programs -- methods and computational results
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- MOPS -- Mathematical optimization system
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Solving large-scale mixed-integer programs with fixed charge variables
- Strong formulations for mixed integer programming: A survey
Cited in
(5)- Progress in presolving for mixed integer programming
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- Solving large-scale mixed-integer programs with fixed charge variables
- Presolve Reductions in Mixed Integer Programming
- Complexity evaluation of benchmark instances for the \(p\)-median problem
This page was built for publication: Supernode processing of mixed-integer models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342883)
