Pages that link to "Item:Q2802547"
From MaRDI portal
The following pages link to Computational Approaches to Max-Cut (Q2802547):
Displayed 5 items.
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)