Login / Signup
An efficiency-based path-scanning heuristic for the capacitated arc routing problem.
Rafael Kendy Arakaki
Fabio Luiz Usberti
Published in:
Comput. Oper. Res. (2019)
Keyphrases
</>
image processing
lower bound
search strategies
lower and upper bounds
database
simulated annealing
solution quality
information systems
bayesian networks
search algorithm
computational complexity
upper bound
tabu search
combinatorial optimization
minimum cost