Partition inequalities for capacitated survivable network design based on directed p-cycles.
Alper AtamtürkDeepak RajanPublished in: Discret. Optim. (2008)
Keyphrases
- facet defining
- multi item
- sufficient conditions
- network design problem
- routing problem
- lot sizing
- capacity constraints
- valid inequalities
- single source
- multi source
- vehicle routing problem
- np hard
- linear inequalities
- partitioning algorithm
- mixed integer
- data sets
- traveling salesman problem
- facility location
- facility location problem
- planar graphs
- production inventory
- facet defining inequalities
- neural network