Models for the piecewise linear unsplittable multicommodity flow problems
Year of publication: |
16 August 2017
|
---|---|
Authors: | Fortz, Bernard ; Gouveia, Luís ; Joyce-Moniz, Martim |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 261.2017, 1 (16.8.), p. 30-42
|
Subject: | Networks | OR in telecommunications | Unsplittable flows | Integer programming | Combinatorial optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Telekommunikation | Telecommunications | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research |
-
Solving minimum-cost shared arborescence problems
Álvarez-Miranda, Eduardo, (2017)
-
A column generation heuristic for optimal wireless sensor network design with mobile sinks
Keskin, Muhammed Emre, (2017)
-
Baldacci, Roberto, (2023)
- More ...
-
Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints
Gouveia, Luís, (2018)
-
Anjos, Miguel F., (2020)
-
Applications of meta-heuristics to traffic engineering in IP networks
Fortz, Bernard, (2011)
- More ...