{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T17:20:51Z","timestamp":1770484851457,"version":"3.49.0"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319181608","type":"print"},{"value":"9783319181615","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18161-5_2","type":"book-chapter","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T08:51:26Z","timestamp":1430383886000},"page":"15-25","source":"Crossref","is-referenced-by-count":6,"title":["An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems"],"prefix":"10.1007","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[]},{"given":"Ibrahim","family":"Moussa","sequence":"additional","affiliation":[]},{"given":"Toufik","family":"Saadi","sequence":"additional","affiliation":[]},{"given":"Sagvan","family":"Saleh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/3-540-45749-6_44","volume-title":"Algorithms - ESA 2002","author":"T. Fahle","year":"2002","unstructured":"Fahle, T.: Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 485\u2013498. Springer, Heidelberg (2002)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.disopt.2007.09.005","volume":"4","author":"N. Faure","year":"2007","unstructured":"Faure, N., Chr\u00e9tienne, P., Gourdin, E., Sourd, F.: Biclique Completion Problems for Multicast Network Design. Discrete Optimization\u00a04, 360\u2013377 (2007)","journal-title":"Discrete Optimization"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-01929-6_8","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S. Gualandi","year":"2009","unstructured":"Gualandi, S.: k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 87\u2013101. Springer, Heidelberg (2009)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1111\/j.1475-3995.2012.00860.x","volume":"20","author":"S. Gualandi","year":"2013","unstructured":"Gualandi, S., Maffioli, F., Magni, C.: A Branch-and-Price Approach to k-Clustering Minimum Biclique Completion Problem. International Transactions in Operational Research\u00a020, 101\u2013117 (2013)","journal-title":"International Transactions in Operational Research"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1057\/palgrave.jors.2602046","volume":"57","author":"M. Hifi","year":"2006","unstructured":"Hifi, M., Michrafy, M.: A Reactive Local Search-Based Algorithm for the Disjunctively Knapsack Problem. Journal of the Operational Research Society\u00a057, 718\u2013726 (2006)","journal-title":"Journal of the Operational Research Society"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"2_CR8","unstructured":"Cplex Solver: IBM, ILOG, \n                      http:\/\/www.ilog.com\/products\/cplex\/"}],"container-title":["Advances in Intelligent Systems and Computing","Modelling, Computation and Optimization in Information Systems and Management Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18161-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T05:18:36Z","timestamp":1676956716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18161-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181608","9783319181615"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18161-5_2","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}