Pages that link to "Item:Q2487852"
From MaRDI portal
The following pages link to The vertex separator problem: a polyhedral investigation (Q2487852):
Displaying 23 items.
- An exact algorithm for solving the vertex separator problem (Q628743) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- The multi-terminal vertex separator problem: branch-and-cut-and-price (Q827608) (← links)
- Approximating polyhedra with sparse inequalities (Q896289) (← links)
- A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081) (← links)
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut (Q1728091) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem (Q1753627) (← 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)
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs (Q2329655) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- The vertex separator problem: algorithms and computations (Q2487851) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness (Q2835687) (← links)
- (Q2861519) (← links)
- On the minimum cut separator problem (Q2892143) (← links)
- Exact algorithms for the vertex separator problem in graphs (Q3008917) (← links)
- Knowledge Discovery in Graphs Through Vertex Separation (Q3305126) (← links)
- Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)