The multi-terminal vertex separator problem: branch-and-cut-and-price

DOI10.1016/j.dam.2020.06.021zbMath1457.90127OpenAlexW3084876581MaRDI QIDQ827608

Sébastien Martin, Youcef Magnouche, Ali Ridha Mahjoub

Publication date: 13 January 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.06.021

zbMATH Keywords

column generationcombinatorial optimizationinteger linear programmingbranch-and-pricebranch-and-cut-and-pricevertex separator problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• An exact algorithm for solving the vertex separator problem
• The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• The vertex separator problem: algorithms and computations
• The vertex separator problem: a polyhedral investigation
• On the minimum cut separator problem
• The Complexity of Multiterminal Cuts
• Multiway cuts in directed and node weighted graphs
• The k-Separator Problem

This page was built for publication: The multi-terminal vertex separator problem: branch-and-cut-and-price