Two new reformulation convexification based hierarchies for 0-1 MIPs
From MaRDI portal
Publication:1748458
DOI10.1155/2015/784817zbMATH Open1387.90162OpenAlexW2193404489WikidataQ59103519 ScholiaQ59103519MaRDI QIDQ1748458FDOQ1748458
Authors: Hacene Ouzia 
Publication date: 11 May 2018
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/784817
Recommendations
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Quadratic convex reformulations for quadratic 0-1 programming
- New convergent heuristics for 0-1 mixed integer programming
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A note on convex reformulation schemes for mixed integer quadratic programs
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems
- Reformulations for utilizing separability when solving convex MINLP problems
- scientific article; zbMATH DE number 94024
- Two linear approximation algorithms for convex mixed integer nonlinear programming
Cites Work
- Combinatorial optimization. Theory and algorithms.
- Title not available (Why is that?)
- Convex extensions and envelopes of lower semi-continuous functions
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- 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
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Estimates of the Duality Gap in Nonconvex Optimization
- Title not available (Why is that?)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Title not available (Why is that?)
- A genetic algorithm for the multidimensional knapsack problem
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes
- Concave extensions for nonlinear 0-1 maximization problems
- Subset Algebra Lift Operators for 0-1 Integer Programming
- A Successive Underestimation Method for Concave Minimization Problems
- Convex underestimators of polynomials
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- Title not available (Why is that?)
- Nonlinear 0–1 programming: I. Linearization techniques
Cited In (2)
This page was built for publication: Two new reformulation convexification based hierarchies for 0-1 MIPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748458)
