Optimization via enumeration: A new algorithm for the max cut problem
From MaRDI portal
Publication:5935710
DOI10.1007/S101070100217zbMath0989.90127MaRDI QIDQ5935710
Anna Galluccio, Jan Vondrák, Martin Loebl
Publication date: 26 June 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (12)
Complexity and Polynomially Solvable Special Cases of QUBO ⋮ \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance ⋮ Maximum Cut Parameterized by Crossing Number ⋮ \textsc{max-cut} and containment relations in graphs ⋮ Subextensive singularity in the 2D \(\pm J\) Ising spin glass ⋮ Aspect-ratio scaling of domain wall entropy for the 2D \(\pm J\) Ising spin glass ⋮ Geometric representations of binary codes and computation of weight enumerators ⋮ Unnamed Item ⋮ max-cut and Containment Relations in Graphs ⋮ Computation of sparse circulant permanents via determinants ⋮ Tight Cycle Relaxations for the Cut Polytope ⋮ Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
This page was built for publication: Optimization via enumeration: A new algorithm for the max cut problem
