On the minimum cut separator problem
From MaRDI portal
Recommendations
Cites work
- Applications of a Planar Separator Theorem
- Compact formulations as a union of polyhedra
- scientific article; zbMATH DE number 1775387 (Why is no real title available?)
- 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
(17)- On minimum cuts and the linear arrangement problem
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut
- Extended formulations for the \(A\)-cut problem
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- The vertex \(k\)-cut problem
- The vertex separator problem: a polyhedral investigation
- Extended cuts
- Models and algorithms for the weighted safe set problem
- The multi-terminal vertex separator problem: polytope characterization and TDI-ness
- Algorithms and formulations for the minimum cut separator problem
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
- A variation on the min cut linear arrangement problem
- scientific article; zbMATH DE number 1500572 (Why is no real title available?)
- scientific article; zbMATH DE number 1783770 (Why is no real title available?)
- An exact algorithm for solving the vertex separator problem
- The multi-terminal vertex separator problem: total dual integrality and polytope composition
- The multi-terminal vertex separator problem: branch-and-cut-and-price
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)