The following pages link to Ibrahima Diarrassouba (Q325405):
Displaying 12 items.
- The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (Q325409) (← links)
- (Q429664) (redirect page) (← links)
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- A hybrid optimization approach for the Steiner \(k\)-connected network design problem (Q1742248) (← links)
- The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut (Q1742250) (← links)
- The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
- A polyhedral study for the buy-at-bulk facility location problem (Q2225048) (← links)
- (Q2787250) (← links)
- Two node-disjoint hop-constrained survivable network design and polyhedra (Q4642418) (← links)
- Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (Q4642425) (← links)
- The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm (Q6166888) (← links)