On linear conic relaxation of discrete quadratic programs
From MaRDI portal
Publication:2829559
Recommendations
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
- Binary quadratic optimization problems that are difficult to solve by conic relaxations
- Copositive realxation for genera quadratic programming
- scientific article; zbMATH DE number 1380758
- Semidefinite programming relaxation for nonconvex quadratic programs
Cites work
- A semidefinite programming approach to the quadratic knapsack problem
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints
- Construction of test problems in quadratic bivalent programming
- Duality gap estimation of linear equality constrained binary quadratic programming
- Exact solutions to task allocation problems
- 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
- Linear Reformulations of Integer Quadratic Programs
- Lower bound improvement and forcing rule for quadratic binary programming
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- On duality gap in binary quadratic programming
- On the Approximate Solution of a Class of Large Discrete Quadratic Programming Problems by $\Delta\Sigma$ Modulation: The Case of Circulant Quadratic Forms
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Some NP-complete problems in quadratic and nonlinear programming
- The quadratic knapsack problem -- a survey
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(6)- On the discrete linear quadratic minimum-time problem
- Using \(\mathrm{DRL}^*\) relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut
- On convex relaxations for quadratically constrained quadratic programming
- On convex relaxations of quadrilinear terms
- Structured linear reformulation of binary quadratically constrained quadratic programs
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
This page was built for publication: On linear conic relaxation of discrete quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829559)
