An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron.
Liang ChenWeikun ChenMu-Ming YangYu-Hong DaiPublished in: J. Glob. Optim. (2021)
Keyphrases
- network design
- convex hull
- optimal solution
- np hard
- network design problem
- network flow problem
- worst case
- simulated annealing
- bi objective
- objective function
- fixed charge
- minimum length
- lower and upper bounds
- dynamic programming
- upper bound
- information systems
- benchmark problems
- computer networks
- linear programming
- single source
- facility location
- search space