{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:59:04Z","timestamp":1777607944112,"version":"3.51.4"},"update-to":[{"DOI":"10.1007\/s11590-015-0971-7","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T00:00:00Z","timestamp":1528329600000}}],"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T00:00:00Z","timestamp":1528329600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s11590-018-1273-7","type":"journal-article","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T03:41:17Z","timestamp":1528342877000},"page":"1959-1969","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Correction to: Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts"],"prefix":"10.1007","volume":"12","author":[{"given":"Yajun","family":"Lu","sequence":"first","affiliation":[]},{"given":"Esmaeel","family":"Moradi","sequence":"additional","affiliation":[]},{"given":"Balabhaskar","family":"Balasundaram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,7]]},"reference":[{"key":"1273_CR1","unstructured":"DIMACS: Graph Partitioning and Graph Clustering: Tenth Dimacs Implementation Challenge. \n                    http:\/\/www.cc.gatech.edu\/dimacs10\/index.shtml\n                    \n                   (2012). Accessed Feb 2015"},{"key":"1273_CR2","unstructured":"Gurobi Optimization, Inc.: Gurobi Optimizer Reference Manual (2017). \n                    http:\/\/www.gurobi.com"},{"key":"1273_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/educ.2013.0112","volume-title":"Theory Driven by Influential Applications","author":"Andrea Lodi","year":"2013","unstructured":"Lodi, A., Tramontani, A.: Performance Variability in Mixed-Integer Programming, chap.\u00a01, pp. 1\u201312. INFORMS Tutorials in Operations Research. INFORMS, Maryland (2013). \n                    https:\/\/doi.org\/10.1287\/educ.2013.0112"},{"issue":"2","key":"1273_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ejor.2011.10.027","volume":"218","author":"A Veremyev","year":"2012","unstructured":"Veremyev, A., Boginski, V.: Identifying large robust network clusters via new compact formulations of maximum \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -club problems. Eur. J. Oper. Res. 218(2), 316\u2013326 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1273_CR5","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1002\/net.21622","volume":"66","author":"A Veremyev","year":"2015","unstructured":"Veremyev, A., Prokopyev, O.A., Pasiliao, E.L.: Critical nodes for distance-based connectivity and related problems in graphs. Networks 66(3), 170\u2013195 (2015)","journal-title":"Networks"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1273-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1273-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1273-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T23:09:42Z","timestamp":1559862582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1273-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,7]]},"references-count":5,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["1273"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1273-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,7]]},"assertion":[{"value":"7 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}