On lower bounds computation for the Discrete Cost Multicommodity Network Design Problem.
Nesrine Bakkar EnnaiferSafa Bhar LayebFarah Zeghal MansourPublished in: CoDIT (2016)
Keyphrases
- network design problem
- branch and bound
- lower bound
- minimal cost
- lagrangian relaxation
- network design
- approximation algorithms
- network flow problem
- branch and bound algorithm
- upper bound
- optimal solution
- np hard
- minimum cost
- mixed integer programming
- feasible solution
- transportation networks
- search space
- exact solution
- search algorithm
- worst case
- column generation
- objective function
- special case
- cost function
- decision variables
- travel time
- combinatorial optimization