An Augmented Arborescence Formulation for the Two-Level Network Design Problem.
Luis Eduardo Neves GouveiaJoão TelhadaPublished in: Ann. Oper. Res. (2001)
Keyphrases
- network design problem
- heuristic solution
- mixed integer
- valid inequalities
- network design
- approximation algorithms
- benders decomposition
- mixed integer programming
- transportation networks
- integer programming
- branch and bound
- lp relaxation
- linear programming
- minimal cost
- lot sizing
- lagrangian relaxation
- traveling salesman problem
- feasible solution
- neural network
- image sequences
- convex hull
- search space
- np hard
- optimal solution
- minimum cost
- linear program
- network architecture
- lower bound
- knapsack problem
- cutting plane
- worst case
- genetic algorithm
- communication networks