Pages that link to "Item:Q941006"
From MaRDI portal
The following pages link to Quadratic convex reformulations for quadratic 0-1 programming (Q941006):
Displaying 15 items.
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
- Extended canonical duality and conic programming for solving 0-1 quadratic programming problems (Q620017) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case (Q3544267) (← links)
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← links)
- (Q5208413) (← links)
