A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
From MaRDI portal
Publication:817200
DOI10.1007/s10479-005-3966-4zbMath1091.90060OpenAlexW2061945583MaRDI QIDQ817200
Hanif D. Sherali, Warren P. Adams
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-3966-4
Related Items
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Mathematical Programming Models and Exact Algorithms, A review of recent advances in global optimization, Optimal mapping of cloud virtual machines, An efficient linearization technique for mixed 0-1 polynomial problem, Characterizing linearizable QAPs by the level-1 reformulation-linearization technique, An LP-based characterization of solvable QAP instances with chess-board and graded structures, A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, Convex and concave envelopes: revisited and new perspectives, Extended formulations for convex envelopes, Exact solution of emerging quadratic assignment problems, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, RLT insights into lift-and-project closures, Reformulations in Mathematical Programming: Definitions and Systematics, Convex hull representations of special monomials of binary variables, A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions, Matroid optimization problems with monotone monomials in the objective, A conditional logic approach for strengthening mixed 0-1 linear programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed-integer bilinear programming problems
- A conditional logic approach for strengthening mixed 0-1 linear programs
- Upper-bounds for quadratic 0-1 maximization
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A new reformulation-linearization technique for bilinear programming problems
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- 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
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Persistency in 0-1 Polynomial Programming
- Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- The Integer Hull of a Convex Rational Polytope
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Global optimization of nonconvex factorable programming problems
