The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds

From MaRDI portal
Revision as of 23:51, 29 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1179735

DOI10.1007/BF02115753zbMath0741.90077OpenAlexW2003648292MaRDI QIDQ1179735

Peter L. Hammer, Endre Boros

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02115753




Related Items (33)

On characterization of maximal independent sets via quadratic optimization\(f\)-flip strategies for unconstrained binary quadratic programmingPolynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problemIntroduction to QUBOApplications and Computational Advances for Solving the QUBO ModelApplications of cut polyhedra. IIOn decomposability of multilinear setsQUBO formulations of the longest path problemSeparator-based data reduction for signed graph balancingFast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representationThe unconstrained binary quadratic programming problem: a surveyNew bounds for the \(\max\)-\(k\)-cut and chromatic number of a graphOn optimization problems in acyclic hypergraphsA new penalty parameter for linearly constrained 0--1 quadratic programming problemsPartitioning planar graphs: a fast combinatorial approach for max-cutA branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problemOptimal price zones of electricity markets: a mixed-integer multilevel model and global solution approachesBinary positive semidefinite matrices and associated integer polytopesA Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)A multiple search operator heuristic for the max-k-cut problemBerge-acyclic multilinear 0-1 optimization problemsThe generalized vertex cover problem and some variationsPseudo-Boolean optimizationMinimization of ordered, symmetric half-productsGlobal optimization of multilevel electricity market models including network design and graph partitioningA tight lower bound for a special case of quadratic 0-1 programmingA filled function method for quadratic programs with binary constraints†Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problemsQuantum bridge analytics. I: A tutorial on formulating and using QUBO modelsQuantum bridge analytics. I: A tutorial on formulating and using QUBO modelsSolving quadratic (0,1)-problems by semidefinite programs and cutting planesThe line index and minimum cut of weighted graphsThe bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases




Cites Work




This page was built for publication: The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds