{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T04:22:15Z","timestamp":1773462135260,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1023\/a:1014509708610","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T20:42:43Z","timestamp":1041108163000},"page":"127-154","source":"Crossref","is-referenced-by-count":21,"title":["Telecommunication Link Restoration Planning with Multiple Facility Types"],"prefix":"10.1007","volume":"106","author":[{"given":"Anantaram","family":"Balakrishnan","sequence":"first","affiliation":[]},{"given":"Thomas L.","family":"Magnanti","sequence":"additional","affiliation":[]},{"given":"Joel S.","family":"Sokol","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"398740_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R. Ahuja","year":"1993","unstructured":"R. Ahuja, T.L. Magnanti and J. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice\u2013Hall, Englewood Cliffs, NJ, 1993)."},{"key":"398740_CR2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.40.5.567","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"A. Balakrishnan, T.L. Magnanti and P. Mirchandani, A dual\u2013based algorithm for multi\u2013level network design, Management Science 40 (1994) 567\u2013581.","journal-title":"Management Science"},{"key":"398740_CR3","doi-asserted-by":"crossref","unstructured":"A. Balakrishnan, T.L. Magnanti, J.S. Sokol and Y. Wang, Spare capacity assignment for line restoration using a single facility type, Operations Research (2001) (to appear).","DOI":"10.1287\/opre.50.4.617.2853"},{"key":"398740_CR4","series-title":"Working paper","volume-title":"Strong inequalities for capacitated survivable network design problems","author":"D. Bienstock","year":"1997","unstructured":"D. Bienstock and G. Muratore, Strong inequalities for capacitated survivable network design problems, Working paper, Columbia University, New York, NY (1997)."},{"key":"398740_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/ecja.4410740701","volume":"74","author":"T. Chujo","year":"1991","unstructured":"T. Chujo, H. Komine, K. Miyazaki, T. Ogura and T. Soejima, Distributed self\u2013healing network and its optimum spare\u2013capacity assignment algorithm, Electronics and Communications in Japan, Part 1 74 (1991) 1\u20139.","journal-title":"Electronics and Communications in Japan"},{"key":"398740_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.10.1.1","volume":"10","author":"G. Dahl","year":"1998","unstructured":"G. Dahl and M. Stoer, A cutting plane algorithm for multicommodity survivable network design problems, INFORMS Journal on Computing 10 (1998) 1\u201311.","journal-title":"INFORMS Journal on Computing"},{"key":"398740_CR7","first-page":"88","volume":"12","author":"D.A. Dunn","year":"1994","unstructured":"D.A. Dunn, W.D. Grover and M.H. MacGregor, Comparison of k\u2013shortest paths and maximum flow routing for network facility restoration, IEEE JSAC 12 (1994) 88\u201399.","journal-title":"IEEE JSAC"},{"key":"398740_CR8","unstructured":"F. Fahim and J.C. Shah, Private correspondence (September 1994\u2013May 1995)."},{"key":"398740_CR9","unstructured":"V. Garcia and P. Ritchi, Private conversation (Fall 1996)."},{"key":"398740_CR10","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/S0927-0507(05)80127-6","volume-title":"Network Models","author":"M. Groetschel","year":"1995","unstructured":"M. Groetschel, C. Monma and M. Stoer, Design of survivable networks, in: Network Models, eds. M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, Handbooks in Operations Research and Management Science, Vol. 7 (North\u2013Holland, Amsterdam, 1995) pp. 617\u2013672."},{"key":"398740_CR11","doi-asserted-by":"crossref","unstructured":"W.D. Grover, T.D. Bilodeau and B.D. Venables, Near optimal spare capacity planning in a mesh restorable network, in: IEEE Global Telecommunications Conference (1991) pp. 2007\u20132012.","DOI":"10.1109\/GLOCOM.1991.188711"},{"key":"398740_CR12","doi-asserted-by":"crossref","unstructured":"M. Herzberg, A decomposition approach to assign spare channels in self\u2013healing networks, in: IEEE Global Telecommunications Conference (1993) pp. 1601\u20131605.","DOI":"10.1109\/GLOCOM.1993.318340"},{"key":"398740_CR13","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1109\/90.477723","volume":"3","author":"M. Herzberg","year":"1995","unstructured":"M. Herzberg, S.J. Bye and A. Utano, The hop\u2013limit approach for spare capacity assignment in survivable networks, IEEE\/ACM Transactions on Networking 3 (1995) 775\u2013784.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"398740_CR14","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/3-540-56279-6_87","volume":"650","author":"M. Iri","year":"1992","unstructured":"M. Iri, How to generate realistic sample problems for network optimization, in: Lecture Notes in Computer Science 650 (1992) 342\u2013350.","journal-title":"Lecture Notes in Computer Science"},{"key":"398740_CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.11.2.149","volume":"11","author":"J. Kennington","year":"1999","unstructured":"J. Kennington and J.E. Whitler, An efficient decomposition algorithm to optimize spare capacity in a telecommunications network, INFORMS Journal on Computing 11 (1999) 149\u2013160.","journal-title":"INFORMS Journal on Computing"},{"key":"398740_CR16","doi-asserted-by":"crossref","unstructured":"L. Lee and H.W. Chun, An ANN approach to spare capacity planning, in: IEEE Region 10 International Conference (1992) pp. 891\u2013895.","DOI":"10.1109\/TENCON.1992.271842"},{"key":"398740_CR17","volume-title":"Computation analysis of network optimization algorithms","author":"Y. Lee","year":"1993","unstructured":"Y. Lee, Computation analysis of network optimization algorithms, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA (1993)."},{"key":"398740_CR18","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1147\/sj.82.0136","volume":"8","author":"P.A.W. Lewis","year":"1969","unstructured":"P.A.W. Lewis, A.S. Goodman and J.M. Miller, A pseudo\u2013random number generator for the system 360, IBM System Journal 8 (1969) 136\u2013146.","journal-title":"IBM System Journal"},{"key":"398740_CR19","series-title":"Technical report 1995.3","volume-title":"Survivability in transmission telecommunication networks","author":"A. Lisser","year":"1995","unstructured":"A. Lisser, R. Sarkissian and J. Vial, Survivability in transmission telecommunication networks, Technical report 1995.3, CNET, Paris, France (1995)."},{"key":"398740_CR20","unstructured":"A. Lisser, R. Sarkissian and J. Vial, Optimal joint syntheses of base and spare telecommunication networks, in: International Symposium on Mathematical Programming (1997)."},{"key":"398740_CR21","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"T.L. Magnanti, P. Mirchandani and R. Vachani, Modeling and solving the two\u2013facility capacitated network loading problem, Operations Research 43 (1995) 142\u2013157.","journal-title":"Operations Research"},{"key":"398740_CR22","series-title":"Working paper OR 323\u201397","volume-title":"Polyhedral properties of the network restoration problem\u2013with the convex hull of a special case","author":"T.L. Magnanti","year":"1997","unstructured":"T.L. Magnanti and Y. Wang, Polyhedral properties of the network restoration problem\u2013with the convex hull of a special case, Working paper OR 323\u201397, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA (1997)."},{"key":"398740_CR23","unstructured":"T.L. Magnanti and L. Wolsey, Optimal trees, in: Network Models, eds. M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser, Handbooks in Operations Research and Management Science, Vol. 7 (North\u2013Holland, Amsterdam) pp. 503\u2013616."},{"key":"398740_CR24","first-page":"1","volume":"47","author":"K.A. Meshkovskiy","year":"1992","unstructured":"K.A. Meshkovskiy and A.Y. Rokotyan, Restoration of communications network connectivity following the failure of transmission junctions and lines, Telecommunications and Radio Engineering 47 (1992) 1\u20135.","journal-title":"Telecommunications and Radio Engineering"},{"key":"398740_CR25","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"M. Minoux, Network synthesis and optimum network design problems, Networks 19 (1989) 313\u2013360.","journal-title":"Networks"},{"key":"398740_CR26","doi-asserted-by":"crossref","unstructured":"H. Sakauchi, Y. Nichimura and S. Hasegawa, A self\u2013healing network with an economical spare channel assignment, in: IEEE Global Telecommunications Conference (1990) pp. 438\u2013443.","DOI":"10.1109\/GLOCOM.1990.116551"},{"key":"398740_CR27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"M. Stoer","year":"1994","unstructured":"M. Stoer and G. Dahl, A polyhedral approach to multicommodity survivable network design, Numerische Mathematik 68 (1994) 149\u2013167.","journal-title":"Numerische Mathematik"},{"key":"398740_CR28","unstructured":"R. Vachani and P. Kubat, Design of survivable telecommunications networks: Models and algorithms, in: ORSA\/TIMS Joint National Conference, Phoenix, AZ (1994)."},{"key":"398740_CR29","doi-asserted-by":"crossref","unstructured":"J. Veerasamy, S. Venkatesan and J.C. Shah, Effect of traffic splitting on link and path restoration planning, in: IEEE Global Telecommunications Conference (1994) pp. 1867\u20131871.","DOI":"10.1109\/GLOCOM.1994.513194"},{"key":"398740_CR30","doi-asserted-by":"crossref","unstructured":"J. Veerasamy, S. Venkatesan and J.C. Shah, Spare capacity assignment in telecom networks using path restoration, in: MASCOTS 1995 (1995) pp. 370\u2013375.","DOI":"10.1109\/MASCOT.1995.378644"},{"key":"398740_CR31","volume-title":"Algorithms for the spare capacity design of mesh restorable networks","author":"B.D. Venables","year":"1992","unstructured":"B.D. Venables, Algorithms for the spare capacity design of mesh restorable networks, M. Sci. thesis, University of Alberta, Edmonton, Alberta, Canada (1992)."},{"key":"398740_CR32","doi-asserted-by":"crossref","unstructured":"B.D. Venables, W.D. Grover and M.H. MacGregor, Two strategies for spare capacity placement in mesh restorable networks, in: IEEE International Conference on Communications (1993) pp. 267\u2013271.","DOI":"10.1109\/ICC.1993.397269"},{"key":"398740_CR33","doi-asserted-by":"crossref","unstructured":"C. Yang and S. Hasegawa, FITNESS: Failure immunization technology for network service survivability, in: IEEE Global Telecommunications Conference (1988) pp. 1549\u20131554.","DOI":"10.1109\/GLOCOM.1988.26082"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014509708610.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014509708610\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014509708610.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:19:03Z","timestamp":1747577943000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014509708610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":33,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["398740"],"URL":"https:\/\/doi.org\/10.1023\/a:1014509708610","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}