Pages that link to "Item:Q2436651"
From MaRDI portal
The following pages link to Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651):
Displayed 9 items.
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon (Q1688448) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Discrete Optimization with Decision Diagrams (Q2806864) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
- Continuous Approaches to the Unconstrained Binary Quadratic Problems (Q2958833) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)