A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
From MaRDI portal
Publication:1025998
DOI10.1016/j.dam.2008.03.041zbMath1176.90430OpenAlexW2084796008MaRDI QIDQ1025998
Warren P. Adams, Hanif D. Sherali
Publication date: 23 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.041
RLTreformulation-linearization techniquesemi-infinite programsconvex discrete programsmixed 0-1 programsmixed-discrete programs
Related Items
RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems, An efficient linearization technique for mixed 0-1 polynomial problem, On interval-subgradient and no-good cuts, Efficient separation of RLT cuts for implicit and explicit bilinear products, Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs, A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
Cites Work
- Unnamed Item
- Enhancing RLT relaxations via a new class of semidefinite cuts
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Optimization with disjunctive constraints
- A global optimization algorithm for polynomial programming problems using 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 branch-and-cut method for 0-1 mixed convex programming
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Matrix Analysis
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- On the generation of deep disjunctive cutting planes
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Nonlinear Programming
- Global optimization of nonconvex factorable programming problems
