On linear conic relaxation of discrete quadratic programs

DOI10.1080/10556788.2015.1134528zbMath1355.90050OpenAlexW2339283167WikidataQ57431157 ScholiaQ57431157MaRDI QIDQ2829559

Tiantian Nie, Shu-Cherng Fang, Zhi-bin Deng, John E. Lavery

Publication date: 8 November 2016

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2015.1134528

zbMATH Keywords

discrete quadratic programlinear conic relaxationRLT method

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

Structured linear reformulation of binary quadratically constrained quadratic programs

Uses Software

• CPLEX

Cites Work

• On duality gap in binary quadratic programming
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• The quadratic knapsack problem -- a survey
• Global extremal conditions for multi-integer quadratic programming
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• A semidefinite programming approach to the quadratic knapsack problem
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints
• On the gap between the quadratic integer programming problem and its semidefinite relaxation
• Lower bound improvement and forcing rule for quadratic binary programming
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• Exact Solutions to Task Allocation Problems
• Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
• Linear Reformulations of Integer Quadratic Programs
• Some NP-complete problems in quadratic and nonlinear programming
• Construction of test problems in quadratic bivalent programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• On the Approximate Solution of a Class of Large Discrete Quadratic Programming Problems by $\Delta\Sigma$ Modulation: The Case of Circulant Quadratic Forms