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: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Kosten | Costs |
-
A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
Castro, Jordi, (2021)
-
Scheduling for electricity cost in a smart grid
Burcea, Mihai, (2016)
-
Shortest-path algorithms and dynamic cost changes
Baselau, Sven, (2008)
- More ...
-
Gomes, Teresa, (2002)
-
A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance
Martins, Lúcia, (2006)
-
A meta-model for multiobjective routing in MPLS networks
Craveirinha, José, (2008)
- More ...