An exact algorithm for the service network design problem with hub capacity constraints.
Edward HeNatashia BolandGeorge L. NemhauserMartin W. P. SavelsberghPublished in: Networks (2022)
Keyphrases
- capacity constraints
- lagrangian relaxation
- network design problem
- integer programming
- column generation
- branch and bound algorithm
- network flow
- minimum cost
- approximation algorithms
- lower bound
- mixed integer programming
- branch and bound
- feasible solution
- linear programming
- valid inequalities
- lower and upper bounds
- np hard
- lp relaxation
- network design
- combinatorial optimization
- linear program
- upper bound
- dynamic programming
- optimal solution
- search algorithm
- objective function
- global constraints
- mixed integer
- optimization problems
- shortest path problem
- search space
- transportation networks