Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

From MaRDI portal
Revision as of 23:28, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (73)

Petroleum supply planning: reformulations and a novel decomposition algorithmReformulating the disjunctive cut generating linear programDisjunctive Cuts for Nonconvex MINLPProblems of discrete optimization: challenges and main approaches to solve themObtaining Tighter Relaxations of Mathematical Programs with Complementarity ConstraintsMIR closures of polyhedral setsA note on the selection of Benders' cutsComputing minimal forecast horizons: an integer programming approachSurrogate-RLT cuts for zero-one integer programsTheoretical challenges towards cutting-plane selectionRLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problemsOn optimizing over lift-and-project closuresA modified lift-and-project procedureSparse multi-term disjunctive cuts for the epigraph of a function of binary variablesDynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problemDisjunctive cuts in mixed-integer conic optimizationCombining and strengthening Gomory cutsDynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programsMonoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cutsSplit cuts from sparse disjunctionsLift-and-project cuts for convex mixed integer nonlinear programsA computational study of the cutting plane tree algorithm for general mixed-integer linear programsCoordinated cutting plane generation via multi-objective separationAn exact algorithm for the 0-1 linear knapsack problem with a single continuous variableIntersection cuts from multiple rows: a disjunctive programming approachMixed logical-linear programmingImproved strategies for branching on general disjunctionsConstraint Integer Programming: A New Approach to Integrate CP and MIPSolving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planesStrong-branching inequalities for convex mixed integer nonlinear programsComputations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programsReduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computationsExact MAX-2SAT solution via lift-and-project closureExact methods for solving the elementary shortest and longest path problemsTwo-Stage Stochastic Mixed-Integer Programs: Algorithms and InsightsBranch-and-bound algorithms: a survey of recent advances in searching, branching, and pruningOptimizing over the split closureA brief history of lift-and-projectRevival of the Gomory cuts in the 1990'sRLT insights into lift-and-project closuresLift-and-project for mixed 0-1 programming: recent progressCutting planes in integer and mixed integer programmingOn the separation of disjunctive cutsBranching on general disjunctionsBranch and cut methods for network optimizationElementary closures for integer programs.Partial convexification cuts for 0--1 mixed-integer programsExact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network designPivot-and-reduce cuts: an approach for improving Gomory mixed-integer cutsUsing cutting planes in an interactive reference point approach for multiobjective integer linear programming problemsDisjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound ConstraintsWhen Lift-and-Project Cuts Are DifferentUsing rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigationComputational study of a family of mixed-integer quadratic programming problemsFixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problemsA cutting-plane approach to mixed 0-1 stochastic integer programsCutting planes for integer programs with general integer variablesA linearization method for mixed 0--1 polynomial programsGomory cuts revisitedProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensionsGenerating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variantsComputational study of a family of mixed-integer quadratic programming problemsThe \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexificationLift-and-project for general two-term disjunctionsA combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programmingApproximate fixed-rank closures of covering problemsOn mathematical programming with indicator constraintsAn L-shaped method with strengthened lift-and-project cutsOn the exact separation of cover inequalities of maximum-depthDepth-optimized convexity cutsB\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertaintyProjection, lifting and extended formulation integer and combinatorial optimizationLight on the infinite group relaxation. I: Foundations and taxonomy


Uses Software





This page was built for publication: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework