{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:59:48Z","timestamp":1740099588214,"version":"3.37.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030333935"},{"type":"electronic","value":"9783030333942"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-33394-2_20","type":"book-chapter","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T13:16:49Z","timestamp":1572441409000},"page":"255-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polyhedral Attack on the Graph Approximation Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9319-4390","authenticated-orcid":false,"given":"R. Yu.","family":"Simanchev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0435-6667","authenticated-orcid":false,"given":"I. V.","family":"Urazova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7123-8647","authenticated-orcid":false,"given":"Yu. A.","family":"Kochetov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,27]]},"reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1016\/j.ejor.2006.12.063","volume":"191","author":"Ekaterina Alekseeva","year":"2008","unstructured":"Alekseeva, E., Kochetov, Yu., Plyasunov, A.: Complexity of local search for the p-median problem. Eur. J. Oper. Res. 191, 736\u2013752 (2008)","journal-title":"European Journal of Operational Research"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00453-009-9339-7","volume":"60","author":"S Bocker","year":"2011","unstructured":"Bocker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: evaluation and experiments. Algorithmica 60, 316\u2013334 (2011)","journal-title":"Algorithmica"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s11590-015-0869-4","volume":"1","author":"J Brimberg","year":"2017","unstructured":"Brimberg, J., Janicijevic, S., Mladenovic, N., Urosevic, D.: Solving the clique partitioning problem as a maximally diverse grouping problem. Optim. Lett. 1, 1123\u20131135 (2017)","journal-title":"Optim. Lett."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.endm.2012.10.005","volume":"39","author":"Z. Diakova","year":"2012","unstructured":"Diakova, Z., Kochetov, Yu.: A double VNS heuristic for the facility location and pricing problem. Electron. Notes Discrete Math. 39, 29\u201334 (2012)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"20_CR6","first-page":"73","volume":"8","author":"G\u0160 Fridman","year":"1971","unstructured":"Fridman, G.\u0160.: A graph approximation problem. Upravlyaemye Sistemy 8, 73\u201375 (1971). (in Russian)","journal-title":"Upravlyaemye Sistemy"},{"issue":"45","key":"20_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"B","author":"M Grotschel","year":"1989","unstructured":"Grotschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. B(45), 59\u201396 (1989)","journal-title":"Math. Program."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M Grotschel","year":"1990","unstructured":"Grotschel, M., Wakabayashi, Y.: Facets of the clique partitioning polytope. Math. Program. 47, 367\u2013387 (1990)","journal-title":"Math. Program."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-46908-4_31","volume-title":"Topics in Combinatorics and Graph Theory","author":"M Grotschel","year":"1990","unstructured":"Grotschel, M., Wakabayashi, Y.: Composition of facets of the clique partitioning polytope. In: Bodendiek, R., Henn, R. (eds.) Topics in Combinatorics and Graph Theory, pp. 271\u2013284. Physica-Verlag, Heidelberg (1990). \n                    https:\/\/doi.org\/10.1007\/978-3-642-46908-4_31"},{"key":"20_CR10","volume-title":"Group Technology: Applications to Production Management","author":"I Ham","year":"1988","unstructured":"Ham, I., Hitomi, K., Yoshida, T.: Group Technology: Applications to Production Management. Kluwer, Dordrecht (1988)"},{"key":"20_CR11","first-page":"143","volume":"2","author":"F Harary","year":"1955","unstructured":"Harary, F.: On the notion of balance of a signed graph. Mich. Math. J. 2, 143\u2013146 (1955)","journal-title":"Mich. Math. J."},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10288-014-0268-1","volume":"13","author":"Stefano Iellamo","year":"2014","unstructured":"Iellamo, S., Alekseeva, E., Chen, L., Coupechoux, M., Kochetov, Yu.: Competitive location in cognitive radio networks. 4OR 13(1), 81\u2013110 (2015)","journal-title":"4OR"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10878-005-1861-1","volume":"10","author":"G Kochenberger","year":"2005","unstructured":"Kochenberger, G., Glover, F., Alidaee, B.: Clustering of microarray data via clique partitioning. J. Comb. Optim. 10, 77\u201392 (2005)","journal-title":"J. Comb. Optim."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-44914-2_3","volume-title":"Discrete Optimization and Operations Research","author":"V Il\u2019ev","year":"2016","unstructured":"Il\u2019ev, V., Il\u2019eva, S., Kononov, A.: Short survey on graph correlation clustering with minimization criteria. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 25\u201336. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-44914-2_3"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M K\u0159iv\u00e1nek","year":"1986","unstructured":"K\u0159iv\u00e1nek, M., Mor\u00e1vek, J.: NP-hard problems in hierarchical-tree clustering. Acta Informatica 23, 311\u2013323 (1986)","journal-title":"Acta Informatica"},{"key":"20_CR16","first-page":"395","volume":"43","author":"F Marcotorchino","year":"1981","unstructured":"Marcotorchino, F., Michaud, P.: Heuristic approach to the similarity aggregation problem. Methods Oper. Res. 43, 395\u2013404 (1981)","journal-title":"Methods Oper. Res."},{"issue":"3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107, N., Brimberg, J., Hansen, P., Moreno-P\u00e9rez, J.A.: The p-median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3), 927\u2013939 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"20_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.10004","volume":"38","author":"M Oosten","year":"2001","unstructured":"Oosten, M., Rutten, J.H.G.C., Spieksma, F.C.R.: The clique partitioning problem: facets and patching facets. Networks 38(4), 209\u2013226 (2001)","journal-title":"Networks"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Tru\u00df, A., B\u00f6cker, S.: Exact and heuristic algorithms for weighted cluster editing. In: 6th Annual International Conference on Computational Systems Bioinformatics, vol. 6, pp. 391\u2013401. Imperial College Press, London (2007)","DOI":"10.1142\/9781860948732_0040"},{"issue":"1\u20132","key":"20_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 144(1\u20132), 173\u2013182 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"20_CR21","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1134\/S1990478915020143","volume":"9","author":"R. Yu. Simanchev","year":"2015","unstructured":"Simanchev, R.Yu., Urazova, I.V.: On the polytope faces of the graph approximation problem. J. Appl. Ind. Math. 9(2), 283\u2013291 (2015)","journal-title":"Journal of Applied and Industrial Mathematics"},{"key":"20_CR22","unstructured":"Simanchev, R.Yu., Urazova, I.V.: Separation problem for k-parashutes. In: Proceedings of the DOOR 2016, Vladivostok, Russia, 19\u201323 September, CEUR-WS, vol. 1623, pp. 109\u2013114 (2016)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Tyshkevich, R.I.: Matroidal decompositions of a graph. Diskretnaya Matematika 1(3), 129\u2013139 (1989). (in Russian)","DOI":"10.4064\/-25-1-195-205"},{"key":"20_CR24","unstructured":"Wakabayashi, Y.: Aggregation of binary relations: algorithmic and polyhedral investigations. Ph.D. thesis, Universitat Augsburg, West Germany (1986)"},{"issue":"4","key":"20_CR25","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1137\/0112071","volume":"12","author":"CT Zahn","year":"1964","unstructured":"Zahn, C.T.: Approximating symmetric relations by equivalence relations. J. Soc. Ind. Appl. Math. 12(4), 840\u2013847 (1964)","journal-title":"J. Soc. Ind. Appl. Math."}],"container-title":["Communications in Computer and Information Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33394-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T13:23:15Z","timestamp":1572441795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33394-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030333935","9783030333942"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33394-2_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"27 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/motor2019.uran.ru","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.34","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.64","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}