Login / Signup
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs.
Teresa Gomes
José M. F. Craveirinha
Luísa Jorge
Published in:
J. Comb. Optim. (2010)
Keyphrases
</>
minimal cost
network flow problem
learning algorithm
computational complexity
cost function
mathematical model
undirected graph
candidate pairs
genetic algorithm
data structure
search space
probabilistic model
tree structure
connected components
endpoints
memetic algorithm