Pages that link to "Item:Q2802547"

The following pages link to Computational Approaches to Max-Cut (Q2802547):

Displaying 14 items.

• Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
• Recognizing max-flow min-cut path matrices (Q1103514) (← links)
• A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
• \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← 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)
• Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
• Towards Algorithmic Cut-Introduction (Q2891453) (← links)
• Advanced scatter search for the max-cut problem (Q2901043) (← links)
• Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
• (Q5875545) (← links)
• Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) (← links)