scientific article
From MaRDI portal
zbMath1192.90235MaRDI QIDQ3579443
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Solving MaxCut with quantum imaginary time evolution, Amplification and Derandomization without Slowdown, Sublinear Algorithms for MAXCUT and Correlation Clustering, Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices, Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems