Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
From MaRDI portal
Publication:4363673
DOI10.1287/mnsc.42.9.1229zbMath0880.90105OpenAlexW2039648193MaRDI QIDQ4363673
Egon Balas, Sebastián Ceria, Cornuéjols, Gérard
Publication date: 12 November 1997
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.42.9.1229
Related Items
Petroleum supply planning: reformulations and a novel decomposition algorithm, Reformulating the disjunctive cut generating linear program, Disjunctive Cuts for Nonconvex MINLP, Problems of discrete optimization: challenges and main approaches to solve them, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, MIR closures of polyhedral sets, A note on the selection of Benders' cuts, Computing minimal forecast horizons: an integer programming approach, Surrogate-RLT cuts for zero-one integer programs, Theoretical challenges towards cutting-plane selection, RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, On optimizing over lift-and-project closures, A modified lift-and-project procedure, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem, Disjunctive cuts in mixed-integer conic optimization, Combining and strengthening Gomory cuts, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Split cuts from sparse disjunctions, Lift-and-project cuts for convex mixed integer nonlinear programs, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, Coordinated cutting plane generation via multi-objective separation, An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable, Intersection cuts from multiple rows: a disjunctive programming approach, Mixed logical-linear programming, Improved strategies for branching on general disjunctions, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes, Strong-branching inequalities for convex mixed integer nonlinear programs, Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs, Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations, Exact MAX-2SAT solution via lift-and-project closure, Exact methods for solving the elementary shortest and longest path problems, Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Optimizing over the split closure, A brief history of lift-and-project, Revival of the Gomory cuts in the 1990's, RLT insights into lift-and-project closures, Lift-and-project for mixed 0-1 programming: recent progress, Cutting planes in integer and mixed integer programming, On the separation of disjunctive cuts, Branching on general disjunctions, Branch and cut methods for network optimization, Elementary closures for integer programs., Partial convexification cuts for 0--1 mixed-integer programs, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts, Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, When Lift-and-Project Cuts Are Different, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, Computational study of a family of mixed-integer quadratic programming problems, Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems, A cutting-plane approach to mixed 0-1 stochastic integer programs, Cutting planes for integer programs with general integer variables, A linearization method for mixed 0--1 polynomial programs, Gomory cuts revisited, ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions, Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants, Computational study of a family of mixed-integer quadratic programming problems, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Lift-and-project for general two-term disjunctions, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, Approximate fixed-rank closures of covering problems, On mathematical programming with indicator constraints, An L-shaped method with strengthened lift-and-project cuts, On the exact separation of cover inequalities of maximum-depth, Depth-optimized convexity cuts, B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty, Projection, lifting and extended formulation integer and combinatorial optimization, Light on the infinite group relaxation. I: Foundations and taxonomy
Uses Software
