Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
From MaRDI portal
(Redirected from Publication:2089865)
Recommendations
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A polyhedral study of nonconvex quadratic programs with box constraints
- On nonconvex quadratic programming with box constraints
- Relaxing the optimality conditions of box QP
Cites work
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Network flows. Theory, algorithms, and applications.
- On the cut polytope
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
Cited in
(4)- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Relaxing the optimality conditions of box QP
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
This page was built for publication: Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089865)
