Pages that link to "Item:Q2436651"

The following pages link to Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651):

Displaying 20 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)
• Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
• \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← 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)
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
• Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
• An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
• A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
• Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) (← links)