Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
From MaRDI portal
Publication:4025902
DOI10.1287/ijoc.3.2.121zbMath0755.90062OpenAlexW1965772065MaRDI QIDQ4025902
Manfred W. Padberg, Karla L. Hoffman
Publication date: 18 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.3.2.121
branch-and-cutvariable eliminationpreprocessingzero-one linear programmingdetection of redundant rowsspecial-ordered-set constraints
Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Knapsack polytopes: a survey, On the complexity of sequentially lifting cover inequalities for the knapsack polytope, Solving \(0/1\) integer programs with enumeration cutting planes, Optimizing single-terminal dispatch of large volume trips to trucks, Supernode processing of mixed-integer models, Coefficient strengthening: a tool for reformulating mixed-integer programs, Separation algorithms for 0-1 knapsack polytopes, Theoretical challenges towards cutting-plane selection, Binary integer programs with two variables per inequality, Lifting the knapsack cover inequalities for the knapsack polytope, \(O(n \log n)\) procedures for tightening cover inequalities, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems, Air cargo scheduling: integrated models and solution procedures, Progress in presolving for mixed integer programming, Domain reduction techniques for global NLP and MINLP optimization, Complexity evaluation of benchmark instances for the \(p\)-median problem, Two-row and two-column mixed-integer presolve using hashing-based pairing methods, Conflict graphs in solving integer programming problems, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Classical cuts for mixed-integer programming and branch-and-cut, Generalized coefficient strengthening cuts for mixed integer programming, Progress in computational mixed integer programming -- a look back from the other side of the tipping point, On lifted cover inequalities: a new lifting procedure with unusual properties, \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates, Presolve Reductions in Mixed Integer Programming, On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs, Minimum cost capacity installation for multicommodity network flows, Cutting planes for mixed-integer knapsack polyhedra, A procedure for optimizing tactical response in oil spill clean up operations, Computational implementation of Fujishige's graph realizability algorithm, On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint, Evolution and state-of-the-art in integer programming, Combinatorial optimization: current successes and directions for the future, Dominance breaking constraints, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems, Minimizing makespan on parallel machines subject to release dates and delivery times, A conditional logic approach for strengthening mixed 0-1 linear programs, Logical processing for integer programming, Airline crew scheduling: state-of-the-art
Uses Software
