Lagrangian relaxation in the multicriterial routing.
Krzysztof StachowiakJoanna WeissenbergPiotr ZwierzykowskiPublished in: AFRICON (2011)
Keyphrases
- lagrangian relaxation
- shortest path
- integer programming
- feasible solution
- lower bound
- np hard
- column generation
- dynamic programming
- linear programming
- branch and bound algorithm
- capacity constraints
- lower and upper bounds
- routing algorithm
- mixed integer programming
- dual decomposition
- network design problem
- mixed integer program
- single machine scheduling problem
- relaxation algorithm
- lagrangian heuristic
- routing problem
- routing protocol
- mixed integer linear programs
- lagrangian dual
- linear program
- objective function
- learning algorithm
- neural network