The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis

INFORMS Journal on Computing

Volumn 13, Issue 3, 2001, Pages 181-190

  Kennington, Jeffery L ^a   Lewis, Mark W ^a  

^a Southern Methodist University   (United States)

Author keywords

Applications; Communications; Integer; Networks Graphs; Programming

Indexed keywords

EID: 0010465714     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.13.3.181.12629     Document Type: Article

References (17)

1. Abou-Sayed, M., J. Kennington, S. Nair. 1997. Joint working and spare capacity assignment in a link restorable mesh network. Technical Report 96-CSE-16, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX.
2. Assad, A. 1978. Multicommodity network flows - a survey. Networks 8 31-91.
3. Bai, D., T. Carpenter, J. Mulvey. 1997. Making a case for robust optimization models. Management Science 43 895-907.
4. Barnhart, C., E. Johnson, G. Nemhauser, M. Savelsbergh, P. Vance. 1992. Branch-and-price: column generation for solving huge integer programs. Technical Report, Computer Optimization Center, Georgia Institute of Technology, Atlanta, GA.
5. Chujo, T., H. Komine, K. Miyazaki, T. Ogura, T. Soejima. 1991. Distributed self-healing network and its optimum spare-capacity assignment algorithm. Electronics and Communication in Japan 74, 1-9.
6. Grover, W., T. Bilodeau, B. Venables. 1991. Near optimal synthesis of a mesh restorable network. GLOBECOM 1991 2007-2012.
7. Herzberg, M. 1993. A decomposition approach to assign spare channels in self healing networks. GLOBECOM 1993 1601-1605.
8. Herzberg M., S. Bye. 1994. An optimal spare capacity assignment model for survivable networks with hop limits. GLOBECOM 1994 3 1601-1606.
9. Iraschko, R., M. MacGregor, W. Grover. 1998. Optimal capacity placement for path restoration in STM or ATM mesh survivable networks. IEEE/ACM Transactions on Networking 6 325-336.
10. Kennington, J. 1978. A survey of multicommodity network flows. Operations Research 26 209-236.
11. Kennington J., R. Helgason. 1980. Algorithms for Network Programming, John Wiley and Sons, New York, NY.
12. Kennington J., M. Lewis. 1999. Models and algorithms for creating restoration paths in survivable mesh networks. Technical Report 99-CSE-5, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX. www.seas.smu.edu/̃jlk/publications/99-CSE-5.doc.
13. Kennington J., J. Whitler. 1999. An efficient decomposition algorithm to optimize spare capacity in a telecommunications network. INFORMS Journal on Computing 11 149-160.
14. MacGregor M., W. Grover. 1994. Optimized k-shortest paths algorithm for facility restoration. Software - Practice and Experience 24 823-834.
15. Murakami K., H. Kim. 1995. Joint optimization of capacity and flow assignment for self-healing ATM networks. Proceedings of 1995 IEEE International Conference on Communications, 216-220.
16. Sen, S., R. Doverspike, S. Cosares. 1994. Network planning with random demand. Telecommunication Systems 3 11-30.
17. Vanderbeck F., L. Wolsey. 1996. An exact algorithm for IP column generation. Operations Research Letters 19 151-159.