The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic.
M.-G. YoonJohn R. CurrentPublished in: J. Oper. Res. Soc. (2008)
Keyphrases
- heuristic solution
- network design problem
- network flow problem
- capacitated fixed charge
- mixed integer
- network design
- mixed integer programming
- benders decomposition
- approximation algorithms
- lagrangian relaxation
- optimal solution
- valid inequalities
- integer programming
- branch and bound
- transportation networks
- lower bound
- minimal cost
- neural network
- lagrangian heuristic
- solution quality
- lp relaxation
- primal dual
- feasible solution
- dual formulation
- worst case
- continuous variables
- multistage
- dynamic programming
- exact solution
- knapsack problem
- mathematical model
- upper bound
- column generation
- np hard
- evolutionary algorithm
- total cost
- convex hull
- search algorithm
- communication networks