The Design of Partially Survivable Networks
Publisher
Springer New York
Reference18 articles.
1. Balas, E., Zemel, E.: An Algorithm for Large Zero–One Knapsack Problems. Operations Research 28, 1130–1154 (1980)
2. Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., Vance, P.: Branch and Price: Column Generation for Solving Huge Integer Programs. Operations Research 46, 316–329 (1998)
3. Cardwell, R., Monma, C., Wu, T.: Computer Aided Design Procedures for Survivable Fiber Optic Telephone Networks. IEEE Journal on Selective Areas in Communications 7(8), 1188–1197 (1989)
4. Dutta, A., Kubat, P.: Design of Partially Survivable Networks for Cellular Telecommunications Systems. European Journal of Operations Research 118, 52–64 (1999)
5. Gilmore, P., Gomory, R.: A Linear Programming Approach to the Cutting Stock Problem. Operations Research 9, 849–859 (1961)