Faster exact solution of sparse maxcut and QUBO problems
From MaRDI portal
Publication:6095734
DOI10.1007/s12532-023-00236-6zbMath1519.90211arXiv2202.02305OpenAlexW4365815307MaRDI QIDQ6095734
Daniel Rehfeldt, Yuji Shinano, Thorsten Koch
Publication date: 8 September 2023
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.02305
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lifting and separation procedures for the cut polytope
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Experiments in quadratic 0-1 programming
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- QPLIB: a library of quadratic programming instances
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- BiqCrunch
- Presolve Reductions in Mixed Integer Programming
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- An Efficient Heuristic Procedure for Partitioning Graphs
- On the cut polytope
- Reducibility among Combinatorial Problems
- Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
- Quantum Annealing versus Digital Computing
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Engineering Kernelization for Maximum Cut
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
- Implications, conflicts, and reductions for Steiner trees
