On the minimum cut separator problem

DOI10.1002/NET.20478MaRDI QIDQ2892143zbMATH OpenOpenAlexFDO

Authors Walid Ben-Ameur, Mohamed Didi Biha

Publication date 18 June 2012

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20478

zbMATH Keywords

graph partitioningpolytopecutvertex separator

Mathematics Subject Classification ID

Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Algorithms and formulations for the minimum cut separator problem
• The vertex separator problem: a polyhedral investigation
• An exact algorithm for solving the vertex separator problem
• scientific article; zbMATH DE number 1500572
• On the k-cut subgraph polytope

Cites work

• scientific article; zbMATH DE number 1775387 (Why is no real title available?)
• Applications of a Planar Separator Theorem
• Compact formulations as a union of polyhedra
• Minimal multicut and maximal integer multiflow: a survey
• On the dimension of projected polyhedra
• The vertex separator problem: a polyhedral investigation
• Valid inequalities for mixed integer linear programs

Cited in

(16)

• Extended cuts
• The multi-terminal vertex separator problem: branch-and-cut-and-price
• The vertex \(k\)-cut problem
• The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
• The multi-terminal vertex separator problem: polytope characterization and TDI-ness
• On integer and bilevel formulations for the \(k\)-vertex cut problem
• An exact algorithm for solving the vertex separator problem
• The vertex separator problem: a polyhedral investigation
• On minimum cuts and the linear arrangement problem
• A variation on the min cut linear arrangement problem
• scientific article; zbMATH DE number 1783770 (Why is no real title available?)
• Models and algorithms for the weighted safe set problem
• MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
• The multi-terminal vertex separator problem: total dual integrality and polytope composition
• Algorithms and formulations for the minimum cut separator problem
• scientific article; zbMATH DE number 1500572 (Why is no real title available?)

This page was built for publication: On the minimum cut separator problem

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