An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs
Year of publication: |
2010
|
---|---|
Authors: | Gomes, T. ; Craveirinha, José ; Jorge, L. |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 19.2010, 3, p. 394-414
|
Subject: | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Störungsmanagement | Disruption management | Elektronischer Datenaustausch | Electronic data interchange | Telekommunikationsnetz | Telecommunications network |
-
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
Gomes, Teresa, (2009)
-
Improved on-line broadcast scheduling with deadlines
Fung, Stanley P. Y., (2008)
-
Disruption management for vehicle routing problem with time-window changes
Ju, Chunhua, (2017)
- More ...
-
A meta-model for multiobjective routing in MPLS networks
Craveirinha, José, (2008)
-
Girão-Silva, Rita, (2009)
-
On the role of operations research practice in strategic environmental impact assessment
Climaco, João, (2010)
- More ...