Pages that link to "Item:Q2436651"

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

Displaying 36 items.

• Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
• A tight semidefinite relaxation of the MAX CUT problem (Q1417849) (← 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)
• Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← 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)
• Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)
• New quadratic models for the maximum weighted cut problem (Q2501328) (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← 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)
• Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning (Q3453578) (← links)
• (Q4558957) (← links)
• An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems (Q4925247) (← links)
• Global convergence of the alternating projection method for the Max-Cut relaxation problem (Q5005866) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
• BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
• Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
• An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
• Faster exact solution of sparse maxcut and QUBO problems (Q6095734) (← 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)
• A unified pre-training and adaptation framework for combinatorial optimization on graphs (Q6564775) (← links)