An integer programming approach to routing in daisy networks.
Johanna BeckerZsolt CsizmadiaJérôme GaltierAlexandre LaugierJácint SzabóLászló SzegöPublished in: Networks (2006)
Keyphrases
- integer programming
- network topologies
- linear programming
- cutting plane
- np hard
- cutting plane algorithm
- production planning
- ai planning
- lagrangian relaxation
- column generation
- facility location
- constraint programming
- routing algorithm
- network design
- network flow
- vehicle routing problem with time windows
- set covering problem
- transportation problem
- set covering
- integer program
- network topology
- switched networks
- dantzig wolfe decomposition
- learning algorithm
- traffic engineering
- packet switching
- inference problems
- routing protocol
- shortest path
- routing problem
- network structure
- support vector