{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T09:56:48Z","timestamp":1753437408956,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T00:00:00Z","timestamp":1695859200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T00:00:00Z","timestamp":1695859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-023-00249-w","type":"journal-article","created":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T11:02:03Z","timestamp":1695898923000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Heuristic for the k-Partitioning Problem"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2911-627X","authenticated-orcid":false,"given":"Pawel","family":"Kalczynski","sequence":"first","affiliation":[]},{"given":"Zvi","family":"Goldstein","sequence":"additional","affiliation":[]},{"given":"Zvi","family":"Drezner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,28]]},"reference":[{"key":"249_CR1","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1287\/inte.1070.0318","volume":"37","author":"G Dur\u00e1n","year":"2007","unstructured":"Dur\u00e1n G, Guajardo M, Miranda J, Saur\u00e9 D, Souyris S, Weintraub A, Wolf R (2007) Scheduling the Chilean soccer league by integer programming. Interfaces 37:539\u2013552","journal-title":"Interfaces"},{"key":"249_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2009.05.013","volume":"37","author":"G Kendall","year":"2010","unstructured":"Kendall G, Knust S, Ribeiro CC, Urrutia S (2010) Scheduling in sports: an annotated bibliography. Comput Oper Res 37:1\u201319","journal-title":"Comput Oper Res"},{"key":"249_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"GL Nemhauser","year":"1998","unstructured":"Nemhauser GL, Trick MA (1998) Scheduling a major college basketball conference. Oper Res 46:1\u20138","journal-title":"Oper Res"},{"key":"249_CR4","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s11590-015-0869-4","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg J, Jani\u0107ijevi\u0107 S, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2017) Solving the clique partitioning problem as a maximally diverse grouping problem. Optim Lett 11:1123\u20131135","journal-title":"Optim Lett"},{"key":"249_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s11336-009-9126-z","volume":"74","author":"MJ Brusco","year":"2009","unstructured":"Brusco MJ, K\u00f6hn H-F (2009) Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem. Psychometrika 74:685","journal-title":"Psychometrika"},{"key":"249_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel M, Wakabayashi Y (1989) A cutting plane algorithm for a clustering problem. Math Program 45:59\u201396","journal-title":"Math Program"},{"key":"249_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-13111-5_2","volume-title":"Location Science","author":"MS Daskin","year":"2015","unstructured":"Daskin MS, Maass KL (2015) The p-median problem. In: Laporte G, Nickel S, da Gama FS (eds) Location Science. Springer, pp 21\u201345"},{"key":"249_CR8","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","volume":"48","author":"J Brimberg","year":"2000","unstructured":"Brimberg J, Hansen P, Mladenovi\u0107 N, Taillard E (2000) Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem. Oper Res 48:444\u2013460","journal-title":"Oper Res"},{"key":"249_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01584989","volume":"3","author":"RE Kuenne","year":"1972","unstructured":"Kuenne RE, Soland RM (1972) Exact and approximate solutions to the multisource Weber problem. Math Program 3:193\u2013209","journal-title":"Math Program"},{"key":"249_CR10","doi-asserted-by":"crossref","unstructured":"Calik H, Labb\u00e9 M, Yaman H (2015) p-Center problems. In: Location Science. Springer, pp 79\u201392","DOI":"10.1007\/978-3-319-13111-5_4"},{"key":"249_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105468","author":"RL Church","year":"2022","unstructured":"Church RL, Drezner Z (2021) Review of obnoxious facilities location problems. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2021.105468","journal-title":"Comput Oper Res"},{"key":"249_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/9780470317013","volume-title":"Spatial tessellations: concepts and applications of Voronoi diagrams","author":"A Okabe","year":"2000","unstructured":"Okabe A, Boots B, Sugihara K, Chiu SN (2000) Spatial tessellations: concepts and applications of Voronoi diagrams. Wiley Series in Probability and Statistics, John Wiley, Hoboken, NJ"},{"key":"249_CR13","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/5.163412","volume":"80","author":"K Sugihara","year":"1992","unstructured":"Sugihara K, Iri M (1992) Construction of the voronoi diagram for \u201cone million\u2019\u2019 generators in single-precision arithmetic. Proc IEEE 80:1471\u20131484","journal-title":"Proc IEEE"},{"key":"249_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-1-4612-5355-6_7","volume-title":"Facility location: a survey of applications and methods","author":"A Suzuki","year":"1995","unstructured":"Suzuki A, Okabe A (1995) Using Voronoi diagrams. In: Drezner Z (ed) Facility location: a survey of applications and methods. Springer, New York, pp 103\u2013118"},{"key":"249_CR15","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1515\/crll.1908.134.198","volume":"134","author":"G Vorono\u00ef","year":"1908","unstructured":"Vorono\u00ef G (1908) Nouvelles applications des param\u00e8tres continus \u00e0 la th\u00e9orie des formes quadratiques. deuxi\u00e8me m\u00e9moire. recherches sur les parall\u00e9llo\u00e8dres primitifs. J\u00a0f\u00fcr die Reine und Angew\u00a0Math 134:198\u2013287","journal-title":"J\u00a0f\u00fcr die Reine und Angew\u00a0Math"},{"key":"249_CR16","unstructured":"Aloise D (2009) Exact algorithms for minimum sum-of-squares clustering. PhD thesis, Ecole Polytechnique, Montreal, Canada. ISBN:978-0-494-53792-3"},{"key":"249_CR17","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10589-014-9711-7","volume":"61","author":"AM Bagirov","year":"2015","unstructured":"Bagirov AM, Ordin B, Ozturk G, Xavier AE (2015) An incremental clustering algorithm based on hyperbolic smoothing. Comput Optim Appl 61:219\u2013241","journal-title":"Comput Optim Appl"},{"key":"249_CR18","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.patcog.2018.12.022","volume":"88","author":"D Gribel","year":"2019","unstructured":"Gribel D, Vidal T (2019) HG-means: a scalable hybrid genetic algorithm for minimum sum-of-squares clustering. Pattern Recogn 88:569\u2013583","journal-title":"Pattern Recogn"},{"key":"249_CR19","doi-asserted-by":"crossref","unstructured":"Pereira T, Aloise D, Brimberg J, Mladenovi\u0107 N (2018) Review of basic local searches for solving the minimum sum-of-squares clustering problem. In: Open Problems in Optimization and Data Analysis. Springer, pp 249\u2013270","DOI":"10.1007\/978-3-319-99142-9_13"},{"key":"249_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/net.21944","volume":"76","author":"Z Ales","year":"2020","unstructured":"Ales Z, Knippel A (2020) The K-partitioning problem: formulations and branch-and-cut. Networks 76:323\u2013349","journal-title":"Networks"},{"key":"249_CR21","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7 A, Meyerhenke H, Safro I, Sanders P, Schulz C (2016) Recent advances in graph partitioning.\u00a0In: Algorithm Engineering. Springer","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"249_CR22","doi-asserted-by":"crossref","unstructured":"\u00c7ataly\u00fcrek \u00dc, Devine K, Faraj M, Gottesb\u00fcren L, Heuer T, Meyerhenke H, Sanders P, Schlag S, Schulz C, Seemaier D et al (2023) More recent advances in (hyper) graph partitioning. ACM Comput Surv 55(12):1\u201338","DOI":"10.1145\/3571808"},{"key":"249_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112884","volume":"354","author":"S Schwartz","year":"2022","unstructured":"Schwartz S (2022) An overview of graph covering and partitioning. Discret Math 354:112884","journal-title":"Discret Math"},{"key":"249_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","volume":"95","author":"A Lisser","year":"2003","unstructured":"Lisser A, Rendl F (2003) Graph partitioning using linear and semidefinite programming. Math Program 95:91\u2013101","journal-title":"Math Program"},{"key":"249_CR25","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-13111-5_13","volume-title":"Location Science","author":"Z Drezner","year":"2015","unstructured":"Drezner Z (2015) The quadratic assignment problem. In: Laporte G, Nickel S, da Gama FS (eds) Location Science. Springer, Chum, Heidelberg, pp 345\u2013363"},{"key":"249_CR26","first-page":"305","volume":"10","author":"P Gilmore","year":"1962","unstructured":"Gilmore P (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. Journal of SIAM 10:305\u2013313","journal-title":"Journal of SIAM"},{"key":"249_CR27","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economic activities. Econometrica 25:53\u201376","journal-title":"Econometrica"},{"key":"249_CR28","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E Lawler","year":"1963","unstructured":"Lawler E (1963) The quadratic assignment problem. Manage Sci 9:586\u2013599","journal-title":"Manage Sci"},{"key":"249_CR29","volume-title":"Facility location: applications and theory","author":"F Rendl","year":"2002","unstructured":"Rendl F (2002) The quadratic assignment problem. In: Drezner Z, Hamacher H (eds) Facility location: applications and theory. Springer, Berlin"},{"key":"249_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"\u00c9D Taillard","year":"1995","unstructured":"Taillard \u00c9D (1995) Comparison of iterative searches for the quadratic assignment problem. Locat Sci 3:87\u2013105","journal-title":"Locat Sci"},{"key":"249_CR31","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00186-015-0505-1","volume":"82","author":"Z Drezner","year":"2015","unstructured":"Drezner Z, Misevi\u010dius A, Palubeckis G (2015) Exact algorithms for the solution of the grey pattern quadratic assignment problem. Math Methods Oper Res 82:85\u2013105","journal-title":"Math Methods Oper Res"},{"key":"249_CR32","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s11590-021-01732-1","volume":"16","author":"Z Drezner","year":"2022","unstructured":"Drezner Z, Kalczynski P, Misevicius A, Palubeckis G (2022) Finding optimal solutions to several gray pattern instances. Optim Lett 16:713\u2013722. https:\/\/doi.org\/10.1007\/s11590-021-01732-1","journal-title":"Optim Lett"},{"key":"249_CR33","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s00291-005-0010-7","volume":"28","author":"Z Drezner","year":"2006","unstructured":"Drezner Z (2006) Finding a cluster of points and the grey pattern quadratic assignment problem. OR Spectrum 28:417\u2013436","journal-title":"OR Spectrum"},{"key":"249_CR34","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1057\/s41274-016-0023-4","volume":"68","author":"Z Drezner","year":"2017","unstructured":"Drezner Z, Kalczynski P (2017) The continuous grey pattern problem. J Oper Res Soc 68:469\u2013483","journal-title":"J Oper Res Soc"},{"key":"249_CR35","volume-title":"Handbook of mathematical functions","author":"M Abramowitz","year":"1972","unstructured":"Abramowitz M, Stegun I (1972) Handbook of mathematical functions. Dover Publications Inc., New York, NY"},{"key":"249_CR36","unstructured":"Stirling J (1764) Methodus differentialis, sive Tractatus de summatione et interpolatione serierum infinitarum. Auctore Jacobo Stirling, RSS. prostat apud J. Whiston & B. White, in Fleet-street"},{"key":"249_CR37","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MG (1995) Greedy randomized adaptive search procedures. J Global Optim 6:109\u2013133","journal-title":"J Global Optim"},{"key":"249_CR38","unstructured":"Winston WL, Albright SC (2016) Practical management science, 6th edn. Nelson Education"},{"key":"249_CR39","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1057\/jors.1978.213","volume":"29","author":"Z Drezner","year":"1978","unstructured":"Drezner Z, Wesolowsky GO (1978) Facility location on a sphere. J Oper Res Soc 29:997\u20131004","journal-title":"J Oper Res Soc"},{"key":"249_CR40","first-page":"37","volume":"30","author":"Z Drezner","year":"2019","unstructured":"Drezner Z, Drezner TD (2019) The alpha male genetic algorithm. IMA J Manag Math 30:37\u201350","journal-title":"IMA J Manag Math"},{"key":"249_CR41","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1016\/j.cor.2012.10.014","volume":"40","author":"Z Drezner","year":"2013","unstructured":"Drezner Z, Misevi\u010dius A (2013) Enhancing the performance of hybrid genetic algorithms by differential improvement. Comput Oper Res 40:1038\u20131046","journal-title":"Comput Oper Res"},{"key":"249_CR42","unstructured":"de\u00a0Carvalho SA Jr, Rahmann S (2006) Microarray layout as a quadratic assignment problem. In: Huson D, Kohlbacher O, Lupas A, Nieselt K, Zell A (eds) Proceedings of the German Conference on Bioinformatics, vol\u00a083. Bonn. Gesellschaft f\u00fcr Informatik, pp 11\u201320"},{"key":"249_CR43","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156\u2013166","journal-title":"Decis Sci"},{"key":"249_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Boston"},{"key":"249_CR45","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelat CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00249-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00249-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00249-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T17:34:37Z","timestamp":1706895277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00249-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,28]]},"references-count":45,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["249"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00249-w","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2023,9,28]]},"assertion":[{"value":"22 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"70"}}