Pages that link to "Item:Q847837"
From MaRDI portal
The following pages link to Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837):
Displaying 50 items.
- Biq Mac (Q22491) (← links)
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Memetic search for the max-bisection problem (Q339560) (← links)
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques (Q493691) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem (Q969344) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- Local search inequalities (Q1751111) (← links)
- Gaussian mean field lattice gas (Q1753883) (← links)
- Maximum-entropy sampling and the Boolean quadric polytope (Q1756791) (← links)
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- Greedy differencing edge-contraction heuristic for the max-cut problem (Q2060537) (← links)
- Convex optimization under combinatorial sparsity constraints (Q2102824) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
- Certifiably optimal sparse inverse covariance estimation (Q2205987) (← links)
- Cuts in undirected graphs. I (Q2215599) (← links)
- Cuts in undirected graphs. II (Q2215853) (← 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)
- QPLIB: a library of quadratic programming instances (Q2281448) (← 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)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- 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)
