Benders decomposition approach with heuristic improvements for the robust foodgrain supply network design problem.
Ajinkya TanksaleJitendra Kumar JhaPublished in: J. Oper. Res. Soc. (2020)
Keyphrases
- benders decomposition
- network design problem
- exact algorithms
- mixed integer programming
- approximation algorithms
- network design
- mixed integer
- lagrangian relaxation
- branch and bound
- minimal cost
- transportation networks
- np hard
- optimal solution
- combinatorial optimization
- integer programming
- feasible solution
- lp relaxation
- column generation
- message passing
- linear programming
- upper bound
- travel time
- approximate solutions
- convex hull
- linear program
- special case
- genetic algorithm