Integer Linear Programs and Local Search for Max-Cut

DOI10.1137/S0097539793245350zbMath0830.68066OpenAlexW2095008598MaRDI QIDQ4852626

Svatopluk Poljak

Publication date: 28 January 1996

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539793245350

zbMATH Keywords

local searchcubic graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (5)

Metaheuristics: A bibliography ⋮ Convergence and approximation in potential games ⋮ Settling the Complexity of Local Max-Cut (Almost) Completely ⋮ Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games ⋮ Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems

This page was built for publication: Integer Linear Programs and Local Search for Max-Cut