I. Diarrassouba

Available identifiers

Publication	Date of Publication	Type
Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem	2024-05-02	Paper
The constrained-routing and spectrum assignment problem: valid inequalities and branch-and-cut algorithm	2023-08-03	Paper
A polyhedral study for the buy-at-bulk facility location problem	2021-02-04	Paper
The separation problem of rounded capacity inequalities: some polynomial cases	2018-05-24	Paper
On the complexity of the separation problem for rounded capacity inequalities	2018-05-24	Paper
Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem	2018-05-23	Paper
Two node-disjoint hop-constrained survivable network design and polyhedra	2018-05-23	Paper
A hybrid optimization approach for the Steiner \(k\)-connected network design problem	2018-04-11	Paper
The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut	2018-04-11	Paper
The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut	2016-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q2787250	2016-02-25	Paper
The \(k\) edge-disjoint 3-hop-constrained paths polytope	2012-06-20	Paper

This page was built for person: I. Diarrassouba