Pages that link to "Item:Q847837"

The following pages link to Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837):

Displaying 50 items.

• Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
• A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
• On some edge Folkman numbers, small and large (Q2424295) (← links)
• Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
• Computational protein design as an optimization problem (Q2453727) (← links)
• A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169) (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
• Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
• \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← 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)
• A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
• Computational Approaches to Max-Cut (Q2802547) (← links)
• Discrete optimization with decision diagrams (Q2806864) (← links)
• From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (Q2826815) (← links)
• On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)
• Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
• A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
• Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
• An improved interior-point cutting-plane method for binary quadratic optimization (Q2883644) (← links)
• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
• Linear programing relaxations for a strategic pricing problem in electricity markets (Q2968496) (← links)
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
• A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
• Improving spectral bounds for clustering problems by Lagrangian relaxation (Q4918244) (← 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)
• QUBO Software (Q5050151) (← links)
• Quantum Annealing versus Digital Computing (Q5102052) (← links)
• BiqBin: Moving Boundaries for NP-hard Problems by HPC (Q5119114) (← links)
• What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
• Approximate Counting with Deterministic Guarantees for Affinity Computation (Q5357750) (← links)
• (Q5425124) (← links)
• An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming (Q5502239) (← links)
• BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← 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)
• Optimal design of line replaceable units (Q6150236) (← links)