Pages that link to "Item:Q513573"
From MaRDI portal
The following pages link to A multiple search operator heuristic for the max-k-cut problem (Q513573):
Displaying 5 items.
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints (Q2668740) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- Efficient enumeration of the optimal solutions to the correlation clustering problem (Q6162510) (← links)