Projection, lifting and extended formulation integer and combinatorial optimization
From MaRDI portal
Publication:817203
DOI10.1007/s10479-005-3969-1zbMath1091.90041OpenAlexW2087260200MaRDI QIDQ817203
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3969-1
Related Items
The triangle \(k\)-club problem, Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems, Learning physics-based models from data: perspectives from inverse problems and model reduction, An integer programming approach for the 2-class single-group classification problem, Integer programming formulations for the elementary shortest path problem, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, Ideal, non-extended formulations for disjunctive constraints admitting a network representation, Polytopes associated with symmetry handling, Spherical cuts for integer programming problems, On the combinatorics of the 2-class classification problem, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Cutting planes from extended LP formulations, The minimum weakly connected independent set problem: polyhedral results and branch-and-cut, Quasiconvex minimization on a locally finite union of convex sets, A new lift-and-project operator, Identification of unidentified equality constraints for integer programming problems, An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Reformulations for utilizing separability when solving convex MINLP problems, Characterization of facets of the hop constrained chain polytope via dynamic programming, Modelling either-or relations in integer programming, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The perfectly matchable subgraph polytope of an arbitrary graph
- Representability in mixed integer programming. I: Characterization results
- Optimization with disjunctive constraints
- Strengthening cuts for mixed integer programs
- Facial disjunctive programs and sequences of cutting-planes
- An algorithm for disjunctive programs
- An analytical comparison of different formulations of the travelling salesman problem
- Logic-based decision support. Mixed integer model formulation
- On the dimension of projected polyhedra
- Introduction to ABACUS -- a branch-and-cut system
- Disjunctive programming: Properties of the convex hull of feasible points
- An alternative explanation of disjunctive formulations
- A modified lift-and-project procedure
- Projection with a minimal system of inequalities
- A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
- Computational experience with parallel mixed integer programming in a distributed environment
- Sequential convexification in reverse convex and disjunctive programming
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- The perfectly matchable subgraph polytope of a bipartite graph
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Nonlinear 0–1 programming: I. Linearization techniques
- Integer Programming Formulation of Traveling Salesman Problems
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- L’algebre de Boole et ses applications en recherche operationnelle
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Two Rules for Deducing Valid Inequalities for 0-1 Problems
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- On disjunctive cuts for combinatorial optimization
