The following pages link to The vertex \(k\)-cut problem (Q2419357):
Displaying 6 items.
- Political districting to minimize cut edges (Q2099493) (← links)
- A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
