An experimental evaluation of semidefinite programming and spectral algorithms for max cut
From MaRDI portal
Publication:6579779
Recommendations
Cites work
- scientific article; zbMATH DE number 780784 (Why is no real title available?)
- scientific article; zbMATH DE number 3390827 (Why is no real title available?)
- A new algorithm for optimal 2-constraint satisfaction and its implications
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- An exact algorithm for MAX-CUT in sparse graphs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- BiqBin: moving boundaries for NP-hard problems by HPC
- BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Greedy differencing edge-contraction heuristic for the max-cut problem
- Improved Analysis of a Max-Cut Algorithm Based on Spectral Partitioning
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Max cut and the smallest eigenvalue
- New upper bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the average variable degree
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- P-Complete Approximation Problems
- Path optimization for graph partitioning problems
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Reducibility among combinatorial problems
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- TSPLIB—A Traveling Salesman Problem Library
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
This page was built for publication: An experimental evaluation of semidefinite programming and spectral algorithms for max cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579779)
