-
All-to-All Routing and Coloring in Weighted Trees of Rings
A tree of rings is an undirected graph obtained from the union of rings, which intersect two by two in at most one node, such that any two nodes are connected by... -
On the minimum cut separator problem
International audience -
Branch-and-Cut algorithm for the connected-cut problem
International audience -
Un algorithme de branch-and-price-and-cut pour la planification durable de ro...
Un papier sera soumis dans une revue internationale avant la conférence. Nous ne pouvons mettre le lien pour l'instant car il est en cours de finalisation. -
Dimensionnement de réseaux optiques multi-bandes : Polyèdre et Branch-and-Cut
International audience
