A Lagrangian Relaxation Based Heuristic for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem.
Yanzhi LiAndrew LimHong MaPublished in: Australian Conference on Artificial Intelligence (2005)
Keyphrases
- lagrangian relaxation
- shortest path
- minimum length
- mixed integer program
- path length
- subgradient method
- branch and bound search
- shortest path algorithm
- lagrangian dual
- shortest path problem
- mixed integer programming
- road network
- relaxation algorithm
- network design problem
- lagrangian heuristic
- randomly generated test problems
- dual variables
- feasible solution
- finding the shortest path
- column generation
- tabu search
- level set
- multi objective
- feature space