Optimal solution of the discrete cost multicommodity network design problem.
Mehdi MradMohamed HaouariPublished in: Appl. Math. Comput. (2008)
Keyphrases
- network design problem
- minimal cost
- optimal solution
- branch and bound
- heuristic solution
- feasible solution
- mixed integer
- total cost
- network design
- network flow problem
- approximation algorithms
- np hard
- continuous relaxation
- transportation networks
- mixed integer programming
- linear programming
- search space
- minimum cost
- lagrangian relaxation
- integer programming
- column generation
- branch and bound algorithm
- endpoints
- upper bound
- continuous variables
- lp relaxation
- exact solution
- solution quality
- search algorithm
- valid inequalities
- lower bound
- mathematical model
- cutting plane
- tabu search
- linear program
- convex hull
- convex optimization
- knapsack problem