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 8 items.
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)
- A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)
- An experimental evaluation of semidefinite programming and spectral algorithms for max cut (Q6579779) (← links)
- Quantum annealing for neural network optimization problems: a new approach via tensor network simulations (Q6593896) (← links)
- A random copositive matrix is completely positive with positive probability (Q6594418) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)
