Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem.
Agostinho AgraAdelaide CerveiraCristina RequejoPublished in: MOD (2016)
Keyphrases
- lagrangian relaxation
- integer programming
- production planning
- lower and upper bounds
- lower bound
- branch and bound search
- upper bound
- column generation
- np hard
- linear programming
- capacity constraints
- mixed integer program
- branch and bound algorithm
- mixed integer programming
- worst case
- set covering problem
- dual decomposition
- lagrangian heuristic
- network flow
- feasible solution
- production cost
- valid inequalities
- constraint programming
- cutting plane
- dynamic programming
- single machine scheduling problem
- dual variables
- relaxation algorithm
- cutting plane algorithm
- objective function
- cost function
- markov random field
- support vector
- shortest path
- mixed integer linear programs
- branch and bound