Login / Signup
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs.
Teresa Gomes
José M. F. Craveirinha
Luísa Jorge
Published in:
Comput. Oper. Res. (2009)
Keyphrases
</>
minimal cost
computational complexity
learning algorithm
network flow problem
search space
k means
objective function
disjoint paths
simulated annealing
np hard
dynamic programming
probabilistic model
worst case
convex hull
graph structure
primal dual
multi objective
special case
optimal solution