Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem.
Thais ÁvilaÁngel CorberánIsaac PlanaJosé M. SanchisPublished in: EURO J. Comput. Optim. (2017)
Keyphrases
- exact algorithms
- knapsack problem
- approximation algorithms
- combinatorial optimization
- traveling salesman problem
- vehicle routing problem with time windows
- exact solution
- benchmark instances
- computational problems
- combinatorial optimization problems
- benders decomposition
- combinatorial problems
- heuristic methods
- max sat
- routing problem
- multi objective
- shortest path
- neural network