Pages that link to "Item:Q868442"
From MaRDI portal
The following pages link to Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442):
Displayed 6 items.
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Spectral bounds for the maximum cut problem (Q3632965) (← links)
- A filled function method for quadratic programs with binary constraints† (Q5193139) (← links)