DRL^*: A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
From MaRDI portal
Publication:608295
DOI10.1016/J.DAM.2010.08.020zbMATH Open1205.90205OpenAlexW1969240384MaRDI QIDQ608295FDOQ608295
Authors: Michel Minoux, Hacene Ouzia 
Publication date: 25 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.020
Recommendations
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- RLT insights into lift-and-project closures
- Two new reformulation convexification based hierarchies for 0-1 MIPs
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
- scientific article; zbMATH DE number 1302175
integer programmingreformulation-linearization-techniquepseudo-Boolean optimizationdisjunctive-programminglift-and-project
Cites Work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Outline of an algorithm for integer solutions to linear programs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Title not available (Why is that?)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Mixed-integer bilinear programming problems
- Valid inequalities for mixed integer linear programs
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
- Disjunctive Programming
- Optimizing over the first Chvátal closure
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Title not available (Why is that?)
- A genetic algorithm for the multidimensional knapsack problem
- Split closure and intersection cuts
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Chvátal closures for mixed integer programming problems
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- On the separation of split cuts and related inequalities
- Exact MAX-2SAT solution via lift-and-project closure
- A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems
- Elementary closures for integer programs.
Cited In (5)
- RLT insights into lift-and-project closures
- Two new reformulation convexification based hierarchies for 0-1 MIPs
- Partial reformulation-linearization based optimization models for the Golomb ruler problem
- Using \(\mathrm{DRL}^*\) relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut
- An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs
This page was built for publication: DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q608295)
