Integer programming models for the routing and spectrum allocation problem
Year of publication: |
October 2018
|
---|---|
Authors: | Bertero, Federico ; Bianchetti, Marcelo ; Marenco, Javier |
Published in: |
Top : transactions in operations research. - [Berlin] : Springer, ISSN 1134-5764, ZDB-ID 1205918-3. - Vol. 26.2018, 3, p. 465-488
|
Subject: | Flexgrid optical networks | Routing and spectrum allocation | Integer programming | Networks | Mathematik | Mathematics | Tourenplanung | Vehicle routing problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Two-phase branch-and-cut for the mixed capacitated general routing problem
Irnich, Stefan, (2015)
-
Numerically safe lower bounds for the capacitated vehicle routing problem
Fukasawa, Ricardo, (2017)
-
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C., (2023)
- More ...
-
Bertero, Federico, (2023)
-
Exploring the complexity boudary between coloring and list-coloring
Bonomo, Flavia, (2009)
-
Automatic dwelling segmentation of the Buenos Aires Province for the 2010 Argentinian census
Bonomo, Flavia, (2013)
- More ...