Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems.
Yves PochetLaurence A. WolseyPublished in: IPCO (1992)
Keyphrases
- network design
- knapsack problem
- network design problem
- communication networks
- heuristic solution
- dynamic programming
- facility location
- optimization problems
- np hard
- network architecture
- ip networks
- upper bound
- optimal solution
- network flow problem
- flow network
- reverse logistics
- databases
- information systems
- lagrangian relaxation
- feasible solution
- decision support
- switched networks
- special case