Pages that link to "Item:Q1761747"
From MaRDI portal
The following pages link to Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747):
Displaying 7 items.
- Quadratic convex reformulations for quadratic 0-1 programming (Q941006) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)