The multi-terminal vertex separator problem: polytope characterization and TDI-ness

DOI10.1007/978-3-319-45587-7_28MaRDI QIDQ2835687zbMATH OpenOpenAlexFDO

Authors Sébastien Martin, Youcef Magnouche

Publication date 30 November 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-45587-7_28

zbMATH Keywords

combinatorial optimizationpolytope characterizationtotal dual integralityvertex separator problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
• The multi-terminal vertex separator problem: branch-and-cut-and-price
• The vertex separator problem: a polyhedral investigation
• The k-separator problem: polyhedra, complexity and approximation results
• An exact algorithm for solving the vertex separator problem

Cites work

• An exact algorithm for solving the vertex separator problem
• An improved parameterized algorithm for the minimum node multiway cut problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Multiway cuts in node weighted graphs
• On the minimum cut separator problem
• The k-separator problem
• The vertex separator problem: a polyhedral investigation

Cited in

(2)

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

This page was built for publication: The multi-terminal vertex separator problem: polytope characterization and TDI-ness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835687)