A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints
Date
2013Dewey
Recherche opérationnelleSujet
Steiner TSP; travelling salesman problem; IP-over-WDM networks; order constraint; Branch-and-cut algorithmJournal issue
Electronic Notes in Discrete MathematicsVolume
41Publication date
2013Article pages
487–494Publisher
Institute of Mathematical StatisticsCollections
Metadata
Show full item recordAuthor
Borne, Sylvie
Mahjoub, Ali Ridha
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Taktak, Raouia