Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem

DOI10.1007/978-3-540-74450-4_42zbMath1176.90599OpenAlexW1521227966MaRDI QIDQ3611933

Victor F. Cavalcante, Cid Carvalho De Souza

Publication date: 3 March 2009

Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_42

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Continuous quadratic programming formulations of optimization problems on graphs ⋮ Exact algorithms for the vertex separator problem in graphs

This page was built for publication: Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem