Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
From MaRDI portal
Publication:2349139
DOI10.1007/s10107-015-0863-8zbMath1328.90111DBLPjournals/mp/FomeniKL15OpenAlexW1995808778WikidataQ57702134 ScholiaQ57702134MaRDI QIDQ2349139
Franklin Djeumou Fomeni, Adam N. Letchford, Konstantinos Kaparis
Publication date: 19 June 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0863-8
Related Items (6)
A new family of facet defining inequalities for the maximum edge-weighted clique problem ⋮ A cut-and-branch algorithm for the quadratic knapsack problem ⋮ Berge-acyclic multilinear 0-1 optimization problems ⋮ An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations ⋮ A class of valid inequalities for multilinear 0-1 optimization problems ⋮ An RLT approach for solving the binary-constrained mixed linear complementarity problem
Uses Software
Cites Work
- RLT: A unified approach for discrete and continuous nonconvex optimization
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- The quadratic knapsack problem -- a survey
- A study of the quadratic semi-assignment polytope
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Geometric algorithms and combinatorial optimization
- Linear programming for the \(0-1\) quadratic knapsack problem
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Semidefinite programming relaxations for semialgebraic problems
- Tighter representations for set partitioning problems
- Global Optimization with Polynomials and the Problem of Moments
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Quadratic knapsack problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Exact Solution of the Quadratic Knapsack Problem
- A Lagrangian relaxation approach to the edge-weighted clique problem
This page was built for publication: Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
