{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:59Z","timestamp":1740123239841,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T00:00:00Z","timestamp":1594857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T00:00:00Z","timestamp":1594857600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71672126","71532015"],"award-info":[{"award-number":["71672126","71532015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Natural Science Engineering Research council of Canada","award":["87677"],"award-info":[{"award-number":["87677"]}]},{"name":"the Shuguang Program supported by Shanghai Education Development Foundation and Shanghai Municipal Education Commission","award":["SG23"],"award-info":[{"award-number":["SG23"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10479-020-03721-6","type":"journal-article","created":{"date-parts":[[2020,7,16]],"date-time":"2020-07-16T21:08:22Z","timestamp":1594933702000},"page":"229-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A new branch-and-cut approach for the generalized regenerator location problem"],"prefix":"10.1007","volume":"295","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7579-2482","authenticated-orcid":false,"given":"Xiangyong","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0852-2930","authenticated-orcid":false,"given":"Y. P.","family":"Aneja","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,16]]},"reference":[{"key":"3721_CR1","volume-title":"Network Flows: Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network Flows: Theory, algorithms, and applications. Upper Saddle, NJ: Prentice Hall."},{"key":"3721_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-38189-8_11","volume-title":"Facets of combinatorial optimization: Festschrift for Martin Gr\u00f6tschel, chap. The maximum weight connected subgraph problem","author":"E \u00c1lvarez-Miranda","year":"2013","unstructured":"\u00c1lvarez-Miranda, E., Ljubi\u0107, I., & Mutzel, P. (2013). Facets of combinatorial optimization: Festschrift for Martin Gr\u00f6tschel, chap. The maximum weight connected subgraph problem (pp. 245\u2013270). Berlin, Heidelberg: Springer Berlin Heidelberg."},{"key":"3721_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10479-006-0047-2","volume":"146","author":"S Borne","year":"2006","unstructured":"Borne, S., Gourdin, E., Bernard Liau, A., & Mahjoub, R. (2006). Design of survivable ip-over-optical networks. Annals of Operations Research, 146, 41\u201373.","journal-title":"Annals of Operations Research"},{"key":"3721_CR4","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/ijoc.2014.0619","volume":"27","author":"A Buchanan","year":"2015","unstructured":"Buchanan, A., Sung, J. S., Butenko, S., & Pasiliao, E. L. (2015). An integer programming approach for fault-tolerant connected dominating sets. INFORMS Journal on Computing, 27, 178\u2013188.","journal-title":"INFORMS Journal on Computing"},{"key":"3721_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.20366","volume":"55","author":"S Chen","year":"2010","unstructured":"Chen, S., Ljubi\u0107, I., & Raghavan, S. (2010). The regenerator location problem. Networks, 55, 205\u2013220.","journal-title":"Networks"},{"key":"3721_CR6","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1287\/ijoc.2014.0621","volume":"27","author":"S Chen","year":"2015","unstructured":"Chen, S., Ljubi\u0107, I., & Raghavan, S. (2015). The generalized regenerator location problem. INFORMS Journal on Computing, 27, 204\u2013220.","journal-title":"INFORMS Journal on Computing"},{"key":"3721_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10479-013-1403-7","volume":"222","author":"F Colombo","year":"2014","unstructured":"Colombo, F., & Trubian, M. (2014). A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous wdm networks. Annals of Operations Research, 222, 239\u2013260.","journal-title":"Annals of Operations Research"},{"key":"3721_CR8","unstructured":"Fischetti, M., Leitner, M., Ljubi\u0107, I., Luipersbeck, M., Monaci, M., Resch, M., et al. (2014). Thinning out steiner trees: A node-based model for uniform edge costs. In 11th DIMACS implementation challenge in collaboration with ICERM: Steiner tree problems, December 4\u20135, 2014, Rhode Island, USA."},{"key":"3721_CR9","volume-title":"Flows in networks","author":"LR Ford","year":"1974","unstructured":"Ford, L. R., & Fulkerson, D. R. (1974). Flows in networks (6th ed.). Princeton: Princeton University Press.","edition":"6"},{"key":"3721_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00186-008-0223-z","volume":"68","author":"A F\u00fcgenschuh","year":"2008","unstructured":"F\u00fcgenschuh, A., & F\u00fcgenschuh, M. (2008). Integer linear programming models for topology optimization in sheet metal design. Mathematical Methods of Operations Research, 68, 313\u2013331.","journal-title":"Mathematical Methods of Operations Research"},{"key":"3721_CR11","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/ijoc.2013.0589","volume":"26","author":"B Gendron","year":"2014","unstructured":"Gendron, B., Lucena, A., Cunha, A., & Simonetti, L. (2014). Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem. INFORMS Journal on Computing, 26, 645\u2013657.","journal-title":"INFORMS Journal on Computing"},{"key":"3721_CR12","first-page":"576","volume":"1","author":"L Gouveia","year":"2003","unstructured":"Gouveia, L., Patr\u00edcio, P., De Sousa, A. F., & Valadas, R. (2003). MPLS over WDM network design with packet level QoS constraints based on ILP models. INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, 1, 576\u2013586.","journal-title":"IEEE Societies"},{"key":"3721_CR13","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.1080.0524","volume":"56","author":"DS Hochbaum","year":"2008","unstructured":"Hochbaum, D. S. (2008). The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Operations Research, 56, 992\u20131009.","journal-title":"Operations Research"},{"key":"3721_CR14","unstructured":"ILOG. (2012). ILOG CPLEX 12.4 User\u2019s Manual. ILOG, Inc., Sunnyvale, CA."},{"key":"3721_CR15","unstructured":"Li, X., & Aneja, Y. P. (2014). Exact approach for the generalized regenerator location problem. Presentation. The 20th conference of the international federation of operational research societies (IFORS2014), July 13\u201318, 2014, Barcelona, Spain."},{"key":"3721_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2016.07.032","volume":"257","author":"X Li","year":"2017","unstructured":"Li, X., & Aneja, Y. P. (2017). Regenerator location problem: Polyhedral study and effective branch-and-cut algorithms. European Journal of Operational Research, 257, 25\u201340.","journal-title":"European Journal of Operational Research"},{"key":"3721_CR17","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1109\/TNET.2012.2186462","volume":"20","author":"GB Mertzios","year":"2012","unstructured":"Mertzios, G. B., Sau, I., Shalom, M., & Zaks, S. (2012). Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE-ACM Transactions on Networking, 20, 1870\u20131879.","journal-title":"IEEE-ACM Transactions on Networking"},{"key":"3721_CR18","unstructured":"Rahman, Q. (2012). Optimization of wdm optical networks. Ph.D. thesis, Unpublished doctoral dissertation, University of Windsor, Windsor, Ontario."},{"key":"3721_CR19","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.osn.2014.09.002","volume":"15","author":"Q Rahman","year":"2015","unstructured":"Rahman, Q., Bandyopadhyay, S., & Aneja, Y. P. (2015). Optimal regenerator placement in translucent optical networks. Optical Switching and Networking, 15, 134\u2013147.","journal-title":"Optical Switching and Networking"},{"key":"3721_CR20","volume-title":"Combinatorial algorithms: Theory and practice","author":"EM Reingold","year":"1977","unstructured":"Reingold, E. M., Nievergelt, J., & Deo, N. (1977). Combinatorial algorithms: Theory and practice. Upper Saddle River: Prentice Hall College Div."},{"key":"3721_CR21","doi-asserted-by":"crossref","unstructured":"Sen, A., Murthy, S., & Bandyopadhyay, S. (2008). On sparse placement of regenerator nodes in translucent optical network. In Proceedings of the 2008 IEEE GLOBECOM conference, New Orleans, Louisiana, USA, IEEE, Piscataway, NJ (pp. 1\u20136).","DOI":"10.1109\/GLOCOM.2008.ECP.513"},{"key":"3721_CR22","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/MCOM.2006.248170","volume":"44","author":"JM Simmons","year":"2006","unstructured":"Simmons, J. M. (2006). Network design in realistic \u201call-optical\u201d backbone networks. IEEE Communications Magazine, 44, 88\u201394.","journal-title":"IEEE Communications Magazine"},{"key":"3721_CR23","volume-title":"Optical network design and planning","author":"JM Simmons","year":"2008","unstructured":"Simmons, J. M. (2008). Optical network design and planning. New York, NY: Springer."},{"key":"3721_CR24","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1024731113866","volume":"6","author":"E Yetginer","year":"2003","unstructured":"Yetginer, E., & Karasan, E. (2003). Regenerator placement and traffic engineering with restoration in GMPLS networks. Photonic Network Communications, 6, 139\u2013149.","journal-title":"Photonic Network Communications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03721-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-020-03721-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03721-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T09:49:54Z","timestamp":1696412994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-020-03721-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,16]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["3721"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03721-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2020,7,16]]},"assertion":[{"value":"16 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}