{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:16:56Z","timestamp":1740107816497,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T00:00:00Z","timestamp":1510531200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s00500-017-2907-x","type":"journal-article","created":{"date-parts":[[2017,11,12]],"date-time":"2017-11-12T23:58:46Z","timestamp":1510531126000},"page":"1947-1964","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A parallel hybrid optimization algorithm for some network design problems"],"prefix":"10.1007","volume":"23","author":[{"given":"Ibrahima","family":"Diarrassouba","sequence":"first","affiliation":[]},{"given":"Mohamed Khalil","family":"Labidi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1079-1892","authenticated-orcid":false,"given":"A. Ridha","family":"Mahjoub","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,13]]},"reference":[{"key":"2907_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall Inc., Upper Saddle River"},{"key":"2907_CR2","series-title":"Chapter lagrangian relaxation","first-page":"243","volume-title":"Modern heuristic techniques for combinatorial problems","author":"J\u00a0E Beasley","year":"1993","unstructured":"Beasley J\u00a0E (1993) Modern heuristic techniques for combinatorial problems. Chapter lagrangian relaxation. Wiley, New York, pp 243\u2013303"},{"issue":"1","key":"2907_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.20310","volume":"55","author":"F Bendali","year":"2010","unstructured":"Bendali F, Diarrassouba I, Didi Biha M, Mahjoub AR, Mailfert J (2010) A branch-and-cut algorithm for the \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -edge connected subgraph problem. Networks 55(1):13\u201332","journal-title":"Networks"},{"issue":"1","key":"2907_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1287\/ijoc.1110.0472","volume":"25","author":"Q Botton","year":"2013","unstructured":"Botton Q, Fortz B, Gouveia L, Poss M (2013) Benders decomposition for the hop-constrained survivable network design problem. INFORMS J Comput 25(1):13\u201326","journal-title":"INFORMS J Comput"},{"key":"2907_CR5","unstructured":"CPLEX (12.5). IBM CPLEX. \n                    http:\/\/www-01.ibm.com\/software\/info\/ilog"},{"issue":"1","key":"2907_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0167-6377(03)00026-9","volume":"32","author":"G Dahl","year":"2004","unstructured":"Dahl G, Gouveia L (2004) On the directed hop-constrained shortest path problem. Oper Res Lett 32(1):15\u201322","journal-title":"Oper Res Lett"},{"issue":"2","key":"2907_CR7","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1002\/net.21667","volume":"67","author":"I Diarrassouba","year":"2016","unstructured":"Diarrassouba I, Gabrel V, Gouveia L, Mahjoub AR, Pesneau P (2016a) Integer programming formulations for the \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -edge-connected 3-hop-constrained network design problem. Networks 67(2):148\u2013169","journal-title":"Networks"},{"issue":"4","key":"2907_CR8","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1002\/net.21679","volume":"67","author":"I Diarrassouba","year":"2016","unstructured":"Diarrassouba I, Mahjoub AR, Kutucu H (2016b) Two node-disjoint hop-constrained survivable network design and polyhedra. Networks 67(4):316\u2013337","journal-title":"Networks"},{"key":"2907_CR9","unstructured":"Diarrassouba I, Mahjoub AR, Yaman H (2017) Integer programming formulations for \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -node-connected hop-constrained survivable network design problem. In: Cahier du LAMSADE, vol 382"},{"issue":"1\u20133","key":"2907_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01580607","volume":"60","author":"MX Goemans","year":"1993","unstructured":"Goemans MX, Bertsimas DJ (1993) Survivable networks, linear programming relaxations and the parsimonious property. Math Program 60(1\u20133):145\u2013166","journal-title":"Math Program"},{"issue":"4","key":"2907_CR11","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/0403043","volume":"3","author":"M Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel M, Monma CL (1990) Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM J Discrete Math 3(4):502\u2013523","journal-title":"SIAM J Discrete Math"},{"key":"2907_CR12","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel M, Monma CL, Stoer M (1992) Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM J Optim 2(3):474\u2013504","DOI":"10.1137\/0802024"},{"issue":"1","key":"2907_CR13","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held M, Karp RM (1971) The traveling-salesman problem and minimum spanning trees: part ii. Math Program 1(1):6\u201325","journal-title":"Math Program"},{"issue":"1","key":"2907_CR14","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1002\/net.20146","volume":"49","author":"D Huygens","year":"2007","unstructured":"Huygens D, Labb\u00e9 M, Mahjoub AR, Pesneau P (2007) The two-edge connected hop-constrained network design problem: valid inequalities and branch-and-cut. Networks 49(1):116\u2013133","journal-title":"Networks"},{"issue":"1","key":"2907_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H Kerivin","year":"2005","unstructured":"Kerivin H, Mahjoub AR (2005) Design of survivable networks: a survey. Networks 46(1):1\u201321","journal-title":"Networks"},{"key":"2907_CR16","doi-asserted-by":"crossref","unstructured":"Kerivin H, Mahjoub AR, Nocq C (2004) (1, 2)-Survivable networks: facets and branch-and-cut. In: Gr\u00f6tschel M (ed) The Sharpest Cut, MPS-SIAM series in Optimization. SIAM, pp 121\u2013152","DOI":"10.1137\/1.9780898718805.ch9"},{"issue":"2","key":"2907_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/net.20046","volume":"45","author":"TL Magnanti","year":"2005","unstructured":"Magnanti TL, Raghavan S (2005) Strong formulations for network design problems with connectivity requirements. Networks 45(2):61\u201379","journal-title":"Networks"},{"issue":"4","key":"2907_CR18","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TCT.1969.1083004","volume":"16","author":"K Steiglitz","year":"1969","unstructured":"Steiglitz K, Weiner P, Kleitman D (1969) The design of minimum-cost survivable networks. IEEE Trans Circuit Theory 16(4):455\u2013460","journal-title":"IEEE Trans Circuit Theory"},{"issue":"5","key":"2907_CR19","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E-G Talbi","year":"2002","unstructured":"Talbi E-G (2002) A taxonomy of hybrid metaheuristics. J Heuristics 8(5):541\u2013564","journal-title":"J Heuristics"},{"key":"2907_CR20","unstructured":"TSPLIB (1995) Gerhard reinelt. \n                    http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\n                    \n                  . Accessed 13 Dec 2015"},{"issue":"2","key":"2907_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P Winter","year":"1987","unstructured":"Winter P (1987) Steiner problem in networks: a survey. Networks 17(2):129\u2013167","journal-title":"Networks"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2907-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2907-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2907-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T05:13:58Z","timestamp":1566969238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2907-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,13]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2907"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2907-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2017,11,13]]},"assertion":[{"value":"13 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Dr. Ibrahima Diarrassouba, Mohamed Khalil Labidi and Prof. A. Ridha Mahjoub declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal ethical standards"}}]}}