{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T05:19:49Z","timestamp":1710911989563},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T00:00:00Z","timestamp":1618272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T00:00:00Z","timestamp":1618272000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s11590-021-01732-1","type":"journal-article","created":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T08:03:44Z","timestamp":1618301024000},"page":"713-722","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Finding optimal solutions to several gray pattern instances"],"prefix":"10.1007","volume":"16","author":[{"given":"Zvi","family":"Drezner","sequence":"first","affiliation":[]},{"given":"Pawel","family":"Kalczynski","sequence":"additional","affiliation":[]},{"given":"Alfonsas","family":"Misevi\u010dius","sequence":"additional","affiliation":[]},{"given":"Gintaras","family":"Palubeckis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,13]]},"reference":[{"key":"1732_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.orl.2004.05.001","volume":"33","author":"WP Adams","year":"2005","unstructured":"Adams, W.P., Forrester, R.J.: A simple recipe for concise mixed 0\u20131 linearizations. Oper. Res. Lett. 33, 55\u201361 (2005)","journal-title":"Oper. Res. Lett."},{"key":"1732_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: Qaplib-a quadratic assignment problem library. J. Global Optim. 10, 391\u2013403 (1997)","journal-title":"J. Global Optim."},{"key":"1732_CR3","unstructured":"CPLEX, IBM ILOG (2019). 12.10: User\u2019s Manual for CPLEX. International Business Machines Corporation, Incline Village, NV"},{"key":"1732_CR4","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s00291-005-0010-7","volume":"28","author":"Z Drezner","year":"2006","unstructured":"Drezner, Z.: Finding a cluster of points and the grey pattern quadratic assignment problem. OR Spectrum 28, 417\u2013436 (2006)","journal-title":"OR Spectrum"},{"key":"1732_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-319-13111-5_13","volume-title":"Location Science","author":"Z Drezner","year":"2015","unstructured":"Drezner, Z.: The quadratic assignment problem. In: Laporte, G., Nickel, S., da Gama, F.S. (eds.) Location Science, pp. 345\u2013363. Springer, Cham (2015)"},{"key":"1732_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z., Hahn, P.M., Taillard, \u00c9.D.: Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Ann. Oper. Res. 139, 65\u201394 (2005)","journal-title":"Ann. Oper. Res."},{"key":"1732_CR7","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.: Exact algorithms for the solution of the grey pattern quadratic assignment problem. Math. Methods Oper. Res. 82, 85\u2013105 (2015)","journal-title":"Math. Methods Oper. Res."},{"key":"1732_CR8","unstructured":"Gurobi Optimization Incorporate (2018). Gurobi optimizer reference manual. URL http:\/\/www.gurobi.com"},{"key":"1732_CR9","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1287\/ijoc.1110.0450","volume":"24","author":"PM Hahn","year":"2012","unstructured":"Hahn, P.M., Zhu, Y.-R., Guignard, M., Hightower, W.L., Saltzman, M.J.: A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem. Inf. J. Comput. 24, 202\u2013209 (2012)","journal-title":"Inf. J. Comput."},{"key":"1732_CR10","unstructured":"Kang, H.R.: Digital color halftoning. SPIE press (1999)"},{"key":"1732_CR11","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1111\/j.1540-5915.1993.tb00509.x","volume":"24","author":"C-C Kuo","year":"1993","unstructured":"Kuo, C.-C., Glover, F., Dhir, K.S.: Analyzing and modeling the maximum diversity problem by zero-one programming. Decision Sci. 24, 1171\u20131185 (1993)","journal-title":"Decision Sci."},{"key":"1732_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60955-9","volume-title":"Principles of Image Printing Technology","author":"YV Kuznetsov","year":"2021","unstructured":"Kuznetsov, Y.V.: Principles of Image Printing Technology. Springer, Cham (2021)"},{"key":"1732_CR13","doi-asserted-by":"publisher","DOI":"10.1201\/9781315219790","volume-title":"Modern Digital Halftoning","author":"DL Lau","year":"2018","unstructured":"Lau, D.L., Arce, G.R.: Modern Digital Halftoning. CRC Press, Boca Raton (2018)"},{"key":"1732_CR14","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Europ. J. Oper. Res. 176, 657\u2013690 (2007)","journal-title":"Europ. J. Oper. Res."},{"key":"1732_CR15","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10732-011-9172-4","volume":"19","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A., Pardo, E.G.: Heuristics and metaheuristics for the maximum diversity problem. J. Heuristics 19, 591\u2013615 (2013)","journal-title":"J. Heuristics"},{"key":"1732_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-020-00321-6","author":"A Misevicius","year":"2021","unstructured":"Misevicius, A., Palubeckis, G., Drezner, Z.: Hierarchicity-based (self-similar) hybrid genetic algorithm for the grey pattern quadratic assignment problem. Memetic Comput. (2021). https:\/\/doi.org\/10.1007\/s12293-020-00321-6","journal-title":"Memetic Comput."},{"key":"1732_CR17","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.amc.2006.11.090","volume":"189","author":"G Palubeckis","year":"2007","unstructured":"Palubeckis, G.: Iterated tabu search for the maximum diversity problem. Appl. Math. Comput. 189, 371\u2013383 (2007)","journal-title":"Appl. Math. Comput."},{"key":"1732_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.053","author":"F Parre\u00f1o","year":"2020","unstructured":"Parre\u00f1o, F., \u00c1lvarez-Vald\u00e9s, R., Mart\u00ed, R.: Measuring diversity a review and an empirical analysis. Europ. J. Oper. Res. (2020). https:\/\/doi.org\/10.1016\/j.ejor.2020.07.053","journal-title":"Europ. J. Oper. Res."},{"issue":"1","key":"1732_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ejor.2008.06.005","volume":"197","author":"OA Prokopyev","year":"2009","unstructured":"Prokopyev, O.A., Kong, N., Martinez-Torres, D.L.: The equitable dispersion problem. Europ. J. Oper. Res. 197(1), 59\u201367 (2009)","journal-title":"Europ. J. Oper. Res."},{"key":"1732_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","volume":"3","author":"\u00c9D Taillard","year":"1995","unstructured":"Taillard, \u00c9.D.: Comparison of iterative searches for the quadratic assignment problem. Location Sci. 3, 87\u2013105 (1995)","journal-title":"Location Sci."},{"key":"1732_CR21","doi-asserted-by":"crossref","unstructured":"Ulichney, R.: Digital halftoning. MIT press (1987)","DOI":"10.7551\/mitpress\/2421.001.0001"},{"key":"1732_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/MSP.2003.1215232","volume":"20","author":"PW Wong","year":"2003","unstructured":"Wong, P.W., Memon, N.D.: Image processing for halftones. IEEE Signal Process. Magaz. 20, 59\u201370 (2003)","journal-title":"IEEE Signal Process. Magaz."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01732-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01732-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01732-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T00:54:09Z","timestamp":1698886449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01732-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,13]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1732"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01732-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,13]]},"assertion":[{"value":"10 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}