The following pages link to Sébastien Martin (Q418002):
Displaying 12 items.
- On the NP-completeness of the perfect matching free subgraph problem (Q418003) (← links)
- (Q827607) (redirect page) (← links)
- The multi-terminal vertex separator problem: branch-and-cut-and-price (Q827608) (← links)
- The multi-terminal vertex separator problem: polyhedral analysis and branch-and-cut (Q1728091) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
- Constrained shortest path tour problem: branch-and-price algorithm (Q2147106) (← links)
- Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm (Q2228388) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness (Q2835687) (← links)
- (Q2861536) (← links)
- Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem (Q3167618) (← links)
