Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths.
Kaj HolmbergMartin JobornKennet MelinPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- network flow problem
- fixed cost
- network design problem
- mixed integer programming
- mixed integer
- lot sizing
- lagrangian relaxation
- network flow
- minimum cost
- minimal cost
- search algorithm
- np hard
- optimal solution
- column generation
- branch and bound
- infinite horizon
- integer programming
- production planning
- valid inequalities
- linear programming
- network design
- multistage
- shortest path
- total cost
- approximation algorithms
- feasible solution
- linear program
- data points
- planning horizon
- branch and bound algorithm
- dynamic programming
- exact solution
- constraint satisfaction problems
- scheduling problem
- cutting plane