{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T11:24:06Z","timestamp":1748604246513,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T00:00:00Z","timestamp":1581552000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T00:00:00Z","timestamp":1581552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001834","name":"University of Twente","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001834","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this work, two network design concepts which have been proven to be relevant with respect to telecommunication applications, are joined within a unified approach. First, the cable trench problem searches for cost-minimizing network structures that take into account two types of edge costs appearing in the installation of wire-based networks, namely trenching costs and cable costs. Second, the facility location problem considers the placement of shared telecommunication equipment, like switches or concentrators, together with an assignment of entities to demand nodes. Following practical needs, we join these concepts within the new capacitated cable trench problem with facility costs and service capacity in terms of number of customers that can be served by facilities. Within this setting, facility location decisions in wire-based networks can be taken under a more realistic cost scenario. A mixed-integer linear program and valid inequalities are proposed. Experiments indicate a positive impact of the valid inequalities on computational time and integrality gap.<\/jats:p>","DOI":"10.1007\/s10100-020-00674-w","type":"journal-article","created":{"date-parts":[[2020,2,13]],"date-time":"2020-02-13T02:02:57Z","timestamp":1581559377000},"page":"713-735","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Modeling the capacitated p-cable trench problem with facility costs"],"prefix":"10.1007","volume":"29","author":[{"given":"Silvia","family":"Schwarze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7286-9501","authenticated-orcid":false,"given":"Eduardo","family":"Lalla-Ruiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,13]]},"reference":[{"key":"674_CR1","unstructured":"Beasley J (2015)\u00a0Or-library. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/pmedinfo.html. Accessed 20 Dec 2019"},{"key":"674_CR2","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.cor.2016.12.015","volume":"81","author":"H Calik","year":"2016","unstructured":"Calik H, Leitner M, Luipersbeck M (2016) A Benders decomposition based framework for solving cable trench problems. Comput Oper Res 81:128\u2013140","journal-title":"Comput Oper Res"},{"key":"674_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-56082-8_9","volume-title":"Facility location: applications and theory","author":"E Gourdin","year":"2002","unstructured":"Gourdin E, Labb\u00e9 M, Yaman H (2002) Telecommunication and location. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory. Springer, Berlin, pp 275\u2013306"},{"key":"674_CR4","doi-asserted-by":"publisher","unstructured":"Guti\u00e9rrez-Jarpa G, Obreque C, Marianov V, Contreras A (2015) P-cable trench problem with covering. SSRN: https:\/\/ssrn.com\/abstract=2814676; https:\/\/doi.org\/10.2139\/ssrn.2814676","DOI":"10.2139\/ssrn.2814676"},{"issue":"2","key":"674_CR5","first-page":"109","volume":"3","author":"A Jamili","year":"2015","unstructured":"Jamili A, Ramezankhani F (2015) An extended mathematical programming model to optimize the cable trench route of power transmission in a metro depot. Int J Transp Eng 3(2):109\u2013123","journal-title":"Int J Transp Eng"},{"key":"674_CR6","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1007\/11893011_117","volume-title":"Knowledge-based intelligent information and engineering systems. No. 4253 in LNAI","author":"DF Jeng","year":"2006","unstructured":"Jeng DF, Kim I, Watada J (2006) DNA-based evolutionary algorithm for cable trench problem. In: Gabrys B, Howlett R, Jain L (eds) Knowledge-based intelligent information and engineering systems. No. 4253 in LNAI. Springer, Berlin, pp 922\u2013929"},{"issue":"1","key":"674_CR7","first-page":"111","volume":"3","author":"D-F Jeng","year":"2007","unstructured":"Jeng D-F, Kim I, Watada J (2007) Bio-inspired evolutionary method for cable trench problem. Int J Innov Comput Inf Control 3(1):111\u2013118","journal-title":"Int J Innov Comput Inf Control"},{"issue":"2","key":"674_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.ejor.2003.10.031","volume":"162","author":"A Klose","year":"2005","unstructured":"Klose A, Drexl A (2005) Facility location models for distribution system design. Eur J Oper Res 162(2):4\u201329","journal-title":"Eur J Oper Res"},{"key":"674_CR9","doi-asserted-by":"crossref","unstructured":"Lalla-Ruiz E, Schwarze S, Vo\u00df S (2016) A matheuristic approach for the $$p$$-cable trench problem. In: Learning and intelligent optimization. Proceedings of LION\u201910, volume 10079 of LNCS. Springer, pp 247\u2013252","DOI":"10.1007\/978-3-319-50349-3_19"},{"key":"674_CR10","doi-asserted-by":"crossref","unstructured":"Landquist E, Vasko FJ, Kresge G, Tal A, Jiang Y, Papademetris X (2018) The generalized Steiner cable-trench problem with application to error correction in vascular image analysis. In: Fink A, F\u00fcgenschuh A, Geiger MJ (eds) Operations research proceedings, 2016. Springer, pp 391\u2013397","DOI":"10.1007\/978-3-319-55702-1_52"},{"key":"674_CR11","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.cor.2011.05.015","volume":"39","author":"V Marianov","year":"2012","unstructured":"Marianov V, Guti\u00e9rrez-Jarpa G, Obreque C, Cornejo O (2012) Lagrangean relaxation heuristics for the $$p$$-cable-trench problem. Comput Oper Res 39:620\u2013628","journal-title":"Comput Oper Res"},{"key":"674_CR12","unstructured":"Marianov V, Guti\u00e9rrez-Jarpa G, Obreque C (2015) P-cable trench problem with covering. In: XXII EUROWorking group on locational analysis meeting, 2015, pp 75\u201376"},{"key":"674_CR13","unstructured":"Nielsen R, Riaz MT, Pedersen J, Madsen O (2008) On the potential of using the cable trench problem in planning of ICT access networks. In: 50th international symposium ELMAR, 2008, pp 585\u2013588"},{"key":"674_CR14","unstructured":"Schwarze S (2015) The multi-commodity cable trench problem. In: Proceedings of the 23rd European conference on information systems (ECIS\u20192015). AIS, completed Research Papers. Paper 165"},{"key":"674_CR15","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0305-0548(00)00083-6","volume":"29","author":"F Vasko","year":"2002","unstructured":"Vasko F, Barbieri R, Rieksts B, Reitmeyer K, Stott K Jr (2002) The cable trench problem: combining the shortest path and minimum spanning tree problems. Comput Oper Res 29:441\u2013458","journal-title":"Comput Oper Res"},{"issue":"3","key":"674_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/net.21614","volume":"67","author":"F Vasko","year":"2016","unstructured":"Vasko F, Landquist E, Kresge G, Tal A, Jiang Y, Papademetris X (2016) A simple and efficient strategy for solving very large-scale generalized cable-trench problems. Networks 67(3):199\u2013208","journal-title":"Networks"},{"key":"674_CR17","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.apenergy.2016.08.094","volume":"182","author":"A W\u0119dzik","year":"2016","unstructured":"W\u0119dzik A, Siewierski T, Szypowski M (2016) A new method for simultaneous optimizing of wind farm\u2019s network layout and cable cross-sections by MILP optimization. Appl Energy 182:525\u2013538","journal-title":"Appl Energy"},{"key":"674_CR18","volume-title":"Concentrator location in telecommunication networks, volume 16 of combinatorial optimization","author":"H Yaman","year":"2005","unstructured":"Yaman H (2005) Concentrator location in telecommunication networks, volume 16 of combinatorial optimization. Springer, Berlin"},{"issue":"5","key":"674_CR19","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1111\/itor.12312","volume":"24","author":"K Zyma","year":"2017","unstructured":"Zyma K, Girard J, Landquist E, Schaper G, Vasko F (2017) Formulating and solving a radio astronomy antenna connection problem as a generalized cable-trench problem: an empirical study. Int Trans Oper Res 24(5):943\u2013957","journal-title":"Int Trans Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-020-00674-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-020-00674-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-020-00674-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T03:23:45Z","timestamp":1619321025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-020-00674-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,13]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["674"],"URL":"https:\/\/doi.org\/10.1007\/s10100-020-00674-w","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2020,2,13]]},"assertion":[{"value":"13 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}