The vertex separator problem: algorithms and computations
From MaRDI portal
Publication:2487851
DOI10.1007/s10107-005-0573-8zbMath1099.90069MaRDI QIDQ2487851
Egon Balas, Cid Carvalho De Souza
Publication date: 8 August 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0573-8
90C35: Programming involving graphs or networks
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Related Items
An exact algorithm for solving the vertex separator problem, MIP reformulations of the probabilistic set covering problem, Optimizing over the split closure, The vertex separator problem: a polyhedral investigation, Exact algorithms for the vertex separator problem in graphs
Uses Software
Cites Work