A branch-and-cut approach for minimum cost multi-level network design.
Sunil ChopraChih-Yang TsaiPublished in: Discret. Math. (2002)
Keyphrases
- minimum cost
- network design
- np hard
- approximation algorithms
- network flow
- communication networks
- network flow problem
- spanning tree
- network design problem
- network simplex algorithm
- capacity constraints
- minimum cost flow
- network architecture
- lower bound
- computer systems
- linear programming
- bi objective
- special case
- optimal solution
- objective function
- edit operations
- neural network