Lagrangian relaxation and enumeration for solving constrained shortest-path problems.
W. Matthew CarlyleJohannes O. RoysetR. Kevin WoodPublished in: Networks (2008)
Keyphrases
- lagrangian relaxation
- shortest path problem
- shortest path
- mixed integer program
- subgradient method
- integer programming
- dynamic programming
- branch and bound algorithm
- feasible solution
- constrained problems
- lower bound
- np hard
- lagrangian dual
- combinatorial optimization problems
- combinatorial optimization
- relaxation algorithm
- dual decomposition
- column generation
- lower and upper bounds
- branch and bound search
- linear programming
- network design problem
- search space
- integer program
- dual variables
- lagrangian heuristic
- optimal solution
- nonlinear programming
- constrained optimization
- directed graph
- random walk
- upper bound
- reinforcement learning