Capacitated m Two-Node Survivable Star Problem.
Gabriel BayáAntonio MauttoneFranco RobledoPablo RomeroPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- network design problem
- network design
- multi period
- network flow problem
- multi item
- vehicle routing problem
- integer programming
- multi layer
- minimal cost
- mixed integer programming
- np hard
- heuristic solution
- facility location
- routing problem
- approximation algorithms
- mixed integer
- multi commodity
- single source
- minimum total cost
- multi source
- optical networks
- social networks
- quality of service
- tree structure
- capacity constraints
- directed graph
- branch and bound
- lot sizing
- valid inequalities
- column generation