On the minimum cut separator problem
From MaRDI portal
Publication:2892143
DOI10.1002/net.20478zbMath1244.05171OpenAlexW2013281124MaRDI QIDQ2892143
Mohamed Didi Biha, Walid Ben-Ameur
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
Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Extended cuts ⋮ The multi-terminal vertex separator problem: branch-and-cut-and-price ⋮ The vertex \(k\)-cut problem ⋮ On integer and bilevel formulations for the \(k\)-vertex cut problem ⋮ Models and algorithms for the weighted safe set problem ⋮ The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut ⋮ Unnamed Item ⋮ The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness
Cites Work
- Unnamed Item
- Minimal multicut and maximal integer multiflow: a survey
- Compact formulations as a union of polyhedra
- Valid inequalities for mixed integer linear programs
- On the dimension of projected polyhedra
- The vertex separator problem: a polyhedral investigation
- Applications of a Planar Separator Theorem
This page was built for publication: On the minimum cut separator problem
