Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: An application to the strategic bidding problem.
Gregory SteegerSteffen RebennackPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- lagrangian relaxation
- network design problem
- benders decomposition
- integer programming
- lower bound
- np hard
- branch and bound algorithm
- mixed integer programming
- lower and upper bounds
- network design
- column generation
- dynamic programming
- mixed integer
- linear programming
- approximation algorithms
- branch and bound
- valid inequalities
- minimal cost
- objective function
- shortest path
- search algorithm