{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:44:41Z","timestamp":1742924681483,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030801182"},{"type":"electronic","value":"9783030801199"}],"license":[{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-80119-9_24","type":"book-chapter","created":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T19:14:28Z","timestamp":1626117268000},"page":"410-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field"],"prefix":"10.1007","author":[{"given":"Mhand","family":"Hifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shohre","family":"Sadeghsa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,13]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Al-Iedani, N., Hifi, M., Saadi, T.: Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem. In 2016 International Conference on Control, Decision and Information Technologies (CoDIT), pp. 639\u2013643. IEEE (2016)","DOI":"10.1109\/CoDIT.2016.7593637"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Ali Saleh, S., Hifi, M.: A fast method for optimizing the K-clustering bi-clique completion problem in telecommunication. J. Duhok Univ. 175\u2013183 (2017)","DOI":"10.26682\/sjuod.2017.20.1.16"},{"issue":"3\u20134","key":"24_CR3","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. Discret. Optim. 4(3\u20134), 360\u2013377 (2007)","journal-title":"Discret. Optim."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-18161-5_2","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"M Hifi","year":"2015","unstructured":"Hifi, M., Moussa, I., Saadi, T., Saleh, S.: An adaptive neighborhood search for k-clustering minimum bi-clique completion problems. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences, pp. 15\u201325. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18161-5_2"},{"issue":"1","key":"24_CR5","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. Int. Trans. Oper. Res. 20(1), 101\u2013117 (2013)","journal-title":"Int. Trans. Oper. Res."},{"key":"24_CR6","series-title":"LNCS","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-klustering minimum biclique completion via a hybrid CP and SDP approach. In: van Hoeve, W.-J., Hooker, J.N. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. LNCS, vol. 5547, pp. 87\u2013101. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01929-6_8"},{"key":"24_CR7","doi-asserted-by":"publisher","unstructured":"Hifi, M., Sadeghsa, S.: Adaptation of the rounding search-based algorithm for the k-clustering minimum completion problem, In: IEEE, the 7th International Conference on Control, Decision and Information Technologies (CoDIT), Prague, Czech Republic, pp. 1150\u20131155 (2020). https:\/\/doi.org\/10.1109\/CoDIT49905.2020.9263846","DOI":"10.1109\/CoDIT49905.2020.9263846"},{"issue":"8","key":"24_CR8","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1080\/0305215X.2013.819096","volume":"46","author":"M Hifi","year":"2014","unstructured":"Hifi, M.: An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem. Eng. Optim. 46(8), 1109\u20131122 (2014)","journal-title":"Eng. Optim."},{"key":"24_CR9","unstructured":"Duginov, O.: On the complexity of the clustering minimum Biclique completion problem (2015)"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80119-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T19:17:36Z","timestamp":1626117456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80119-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,13]]},"ISBN":["9783030801182","9783030801199"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80119-9_24","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2021,7,13]]},"assertion":[{"value":"13 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}