An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
Year of publication: |
2009
|
---|---|
Authors: | Gomes, Teresa ; Craveirinha, José ; Jorge, Luśa |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 36.2009, 5, p. 1670-1682
|
Subject: | Telekommunikationsnetz | Telecommunications network | Elektronischer Datenaustausch | Electronic data interchange | Störungsmanagement | Disruption management | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm |
-
Gomes, T., (2010)
-
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 ...
-
Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
Gomes, Teresa, (2007)
-
Gomes, Teresa, (2002)
-
Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
Gomes, Teresa, (2007)
- More ...