A variable neighborhood search for the network design problem with relays.
Yiyong XiaoAbdullah KonakPublished in: J. Heuristics (2017)
Keyphrases
- variable neighborhood search
- network design problem
- traveling salesman problem
- transportation networks
- valid inequalities
- metaheuristic
- approximation algorithms
- tabu search
- network design
- single machine scheduling problem
- branch and bound
- routing problem
- hybrid method
- heuristic methods
- minimum spanning tree
- minimal cost
- lagrangian relaxation
- vehicle routing problem
- mixed integer programming
- integer programming
- mixed integer
- np hard
- search algorithm
- special case
- combinatorial optimization
- ant colony optimization
- simulated annealing
- combinatorial problems
- spanning tree
- lot sizing
- minimum cost
- road network
- optimization problems
- markov random field