Easy and difficult objective functions for max cut
From MaRDI portal
Publication:1411627
DOI10.1007/s10107-002-0328-8zbMath1030.90130OpenAlexW3124850851WikidataQ58002909 ScholiaQ58002909MaRDI QIDQ1411627
Publication date: 29 October 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0328-8
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
Related Items
Minimum Cuts in Surface Graphs, Single-commodity robust network design with finite and hose demand sets, Complexity and Polynomially Solvable Special Cases of QUBO, The Bipartite QUBO, Forming \(k\) coalitions and facilitating relationships in social networks, The Rank-One Quadratic Assignment Problem, Quantum Annealing versus Digital Computing, Bilevel programming and the separation problem, Partitioning planar graphs: a fast combinatorial approach for max-cut, Patience of matrix games, The separation problem of rounded capacity inequalities: some polynomial cases, On the complexity of the separation problem for rounded capacity inequalities, A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks, A computational comparison of flow formulations for the capacitated location-routing problem, Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty, Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty, Tight Cycle Relaxations for the Cut Polytope
