{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:06:08Z","timestamp":1769558768266,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,10,13]],"date-time":"2011-10-13T00:00:00Z","timestamp":1318464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s11590-011-0409-9","type":"journal-article","created":{"date-parts":[[2011,10,12]],"date-time":"2011-10-12T07:55:29Z","timestamp":1318406129000},"page":"207-220","source":"Crossref","is-referenced-by-count":5,"title":["A new greedy algorithm for the quadratic assignment problem"],"prefix":"10.1007","volume":"7","author":[{"given":"Theodoros P.","family":"Gevezes","sequence":"first","affiliation":[]},{"given":"Leonidas S.","family":"Pitsoulis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,10,13]]},"reference":[{"key":"409_CR1","first-page":"241","volume-title":"Handbook of Combinatorial Optimization, vol. 3","author":"R.E. Burkard","year":"1998","unstructured":"Burkard R.E., \u00c7ela E., Pardalos P.M., Pitsoulis L.S.: The quadratic assignment problem. In: Pardalos, P.M., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization, vol. 3, pp. 241\u2013337. Kluwer Academic Publishers, Boston (1998)"},{"key":"409_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2787-6","volume-title":"The Quadratic Assignment Problem: Theory and Algorithms","author":"E. \u00c7ela","year":"1998","unstructured":"\u00c7ela E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"409_CR3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J. Edmonds","year":"1971","unstructured":"Edmonds J.: Matroids and the greedy algorithm. Math. Program. 1, 127\u2013136 (1971)","journal-title":"Math. Program."},{"key":"409_CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0012-365X(79)90092-X","volume":"28","author":"U. Faigle","year":"1979","unstructured":"Faigle U.: The greedy algorithm for partially ordered sets. Discret. Math. 28, 153\u2013159 (1979)","journal-title":"Discret. Math."},{"key":"409_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0377-2217(83)90078-4","volume":"13","author":"A.M. Frieze","year":"1983","unstructured":"Frieze A.M.: Complexity of a 3-dimensional assignment problem. Eur. J. Oper. Res. 13, 161\u2013164 (1983)","journal-title":"Eur. J. Oper. Res."},{"key":"409_CR6","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","volume":"4","author":"D. Gale","year":"1968","unstructured":"Gale D.: Optimal assignments in an ordered set: an application of matroid theory. J. Combin. Theory 4, 176\u2013180 (1968)","journal-title":"J. Combin. Theory"},{"issue":"1","key":"409_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01917662","volume":"22","author":"D. Hausmann","year":"1978","unstructured":"Hausmann D., Korte B.: K-greedy algorithms for independence systems. Math. Methods Oper. Res. 22(1), 219\u2013228 (1978)","journal-title":"Math. Methods Oper. Res."},{"key":"409_CR8","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/BFb0120891","volume":"12","author":"D. Hausmann","year":"1980","unstructured":"Hausmann D., Korte B., Jenkyns T.A.: Worst case analysis of greedy type algorithms for independence systems. Math. Program. Study 12, 120\u2013131 (1980)","journal-title":"Math. Program. Study"},{"issue":"2","key":"409_CR9","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1137\/0406021","volume":"6","author":"P. Helman","year":"1993","unstructured":"Helman P., Moret B.M.E., Shapiro H.D.: An exact characterization of greedy structures. SIAM J. Discret. Math. 6(2), 274\u2013283 (1993)","journal-title":"SIAM J. Discret. Math."},{"key":"409_CR10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1972","unstructured":"Kernighan B., Lin S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. J. 49, 291\u2013307 (1972)","journal-title":"Bell Syst. J."},{"key":"409_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"T.C. Koopmans","year":"1957","unstructured":"Koopmans T.C., Beckmann M.J.: Assignment problems and the location of economic activities. Econometrica 25, 53\u201376 (1957)","journal-title":"Econometrica"},{"key":"409_CR12","doi-asserted-by":"crossref","unstructured":"Korte, B., Lov\u00e1sz, L.: Mathematical structures underlying greedy algorithms. In: Fundamentals of Computation Theory, vol. 117 of Lecture Notes in Computer Science, pp. 205\u2013209. Springer (1981)","DOI":"10.1007\/3-540-10854-8_22"},{"key":"409_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2002","unstructured":"Korte B., Vygen J.: Combinatorial Optimization: Theory and Algorithms, 2nd edn. Springer, Berlin (2002)","edition":"2"},{"key":"409_CR14","first-page":"195","volume":"46","author":"B. Korte","year":"1979","unstructured":"Korte B., Monma C.L.: Some remarks on a classification of oracle-type algorithms. Int. Ser. Numer. Math. 46, 195\u2013215 (1979)","journal-title":"Int. Ser. Numer. Math."},{"issue":"2\u20133","key":"409_CR15","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10107-006-0036-x","volume":"109","author":"P. Krokhmal","year":"2007","unstructured":"Krokhmal P., Grundel D., Pardalos P.M.: Asymptotic behavior of the expected optimal value of the multidimensional assignment problem. Math. Program. 109(2\u20133), 525\u2013551 (2007)","journal-title":"Math. Program."},{"issue":"1","key":"409_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.11.062","volume":"194","author":"P. Krokhmal","year":"2009","unstructured":"Krokhmal P., Pardalos P.M.: Random assignment problems. Eur. J. Oper. Res. 194(1), 1\u201317 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"409_CR17","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E.L. Lawler","year":"1963","unstructured":"Lawler E.L.: The quadratic assignment problem. Manag. Sci. 9, 586\u2013599 (1963)","journal-title":"Manag. Sci."},{"key":"409_CR18","first-page":"1","volume-title":"Quadratic assignment and related problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos P.M., Rendl F., Wolkowicz H.: The quadratic assignment problem: a survey and recent developments. In: Pardalos, P.M., Wolkowicz, H. (eds) Quadratic assignment and related problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pp. 1\u201342. American Mathematical Society, Providence (1994)"},{"key":"409_CR19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6377(86)90007-6","volume":"4","author":"M. Queyranne","year":"1986","unstructured":"Queyranne M.: Performance ratio of heuristics for triangle inequality quadratic assignment problems. Oper. Res. Lett. 4, 231\u2013234 (1986)","journal-title":"Oper. Res. Lett."},{"key":"409_CR20","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1112\/plms\/s3-7.1.300","volume":"7","author":"R. Rado","year":"1957","unstructured":"Rado R.: A note on independence functions. Proc. Lond. Math. Soc. 7, 300\u2013320 (1957)","journal-title":"Proc. Lond. Math. Soc."},{"key":"409_CR21","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni S., Gonzalez T.: P-complete approximation problems. J. Assoc. Comput. Mach. 23, 555\u2013565 (1976)","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0409-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0409-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0409-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T06:38:18Z","timestamp":1560753498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0409-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,13]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["409"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0409-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,13]]}}}