{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:22:59Z","timestamp":1725898979168},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329630"},{"type":"electronic","value":"9783642329647"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32964-7_28","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T18:49:32Z","timestamp":1345920572000},"page":"277-286","source":"Crossref","is-referenced-by-count":1,"title":["Global Equilibrium Search Algorithms for Combinatorial Optimization Problems"],"prefix":"10.1007","author":[{"given":"Oleg","family":"Shylo","sequence":"first","affiliation":[]},{"given":"Dmytro","family":"Korenkevych","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4598","key":"28_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"28_CR2","first-page":"74","volume":"1","author":"V. Shylo","year":"1999","unstructured":"Shylo, V.: A global equilibrium search method (in russian). Kybernetika i Systemniy Analys\u00a01, 74\u201380 (1999)","journal-title":"Kybernetika i Systemniy Analys"},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/moor.22.2.266","volume":"22","author":"P.C. Schuur","year":"1997","unstructured":"Schuur, P.C.: Classification of acceptance criteria for the simulated annealing algorithm. Mathematics of Operations Research\u00a022(2), 266\u2013275 (1997)","journal-title":"Mathematics of Operations Research"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/0-306-48056-5_10","volume-title":"Handbook of Metaheuristics","author":"D. Henderson","year":"2003","unstructured":"Henderson, D., Jacobson, S., Johnson, A.: The theory and practice of simulated annealing. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 287\u2013319. Kluwer Academic Publishers, Boston (2003)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.parco.2010.08.004","volume":"37","author":"O.V. Shylo","year":"2011","unstructured":"Shylo, O.V., Middelkoop, T., Pardalos, P.M.: Restart strategies in optimization: parallel and serial cases. Parallel Comput.\u00a037, 60\u201368 (2011)","journal-title":"Parallel Comput."},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/10556780701550083","volume":"23","author":"P.M. Pardalos","year":"2008","unstructured":"Pardalos, P.M., Prokopyev, O.A., Shylo, O.V., Shylo, V.P.: Global equilibrium search applied to the unconstrained binary quadratic optimization problem. Optimization Methods Software\u00a023(1), 129\u2013140 (2008)","journal-title":"Optimization Methods Software"},{"key":"28_CR7","unstructured":"Palubeckis, G.: Unconstrained binary quadratic optimization, \n                    \n                      http:\/\/www.soften.ktu.lt\/~gintaras\/binqopt.html\n                    \n                    \n                   (last accessed on October 2008)"},{"key":"28_CR8","unstructured":"Beasley, J.E.: OR-library webpage, \n                    \n                      http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html\n                    \n                    \n                   (last updated on June 2008)"},{"key":"28_CR9","unstructured":"Sloane, N.: Challenge problems: Independent sets in graphs, \n                    \n                      http:\/\/www.research.att.com\/~njas\/doc\/graphs.html\n                    \n                    \n                   (last accessed on October 2008)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Battiti, R., Protasi, M.: Reactive search, a history-sensitive heuristic for max-sat. J. Exp. Algorithmics\u00a02 (January 1997)","DOI":"10.1145\/264216.264220"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Spears, W.M.: Simulated annealing for hard satisfiability problems. In: Johnson, D., Trick, M. (eds.) The Second DIMACS Implementation Challenge. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol.\u00a026, pp. 533\u2013558. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026\/26"},{"key":"28_CR12","unstructured":"Du, D., Gu, J., Pardalos, P.: Satisfiability problem: theory and applications: DIMACS Workshop, March 11-13, vol.\u00a035. Amer. Mathematical Society (1997)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Festa, P., Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.C.: Grasp with path relinking for the weighted maxsat problem. J. Exp. Algorithmics\u00a011, Article No. 2.4 (2006)","DOI":"10.1145\/1187436.1216581"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Festa, P., Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.C.: Grasp with path relinking for the weighted maxsat problem. J. Exp. Algorithmics\u00a011 (February 2007)","DOI":"10.1145\/1187436.1216581"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Resende, M., Feo, T.: A grasp for satisfiability. In: Johnson, D., Trick, M. (eds.) The Second DIMACS Implementation Challenge. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol.\u00a026, pp. 499\u2013520. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026\/24"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Resende, M., Pitsoulis, L., Pardalos, P.: Approximate solution of weighted max-sat problems using grasp. In: Gu, J., Pardalos, P. (eds.) Satisfiability Problem: Theory and Applications. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol.\u00a035, pp. 393\u2013405. American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/035\/11"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1009873324187","volume":"3","author":"M. Yagiura","year":"1999","unstructured":"Yagiura, M., Ibaraki, T.: Analyses on the 2 and 3-flip neighborhoods for the max sat. Journal of Combinatorial Optimization\u00a03, 95\u2013114 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1-2","key":"28_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/A:1006343127545","volume":"24","author":"P. Mills","year":"2000","unstructured":"Mills, P., Tsang, E.: Guided local search for solving sat and weighted max-sat problems. J. Autom. Reason.\u00a024(1-2), 205\u2013223 (2000)","journal-title":"J. Autom. Reason."},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Shylo, O.V., Prokopyev, O.A., Shylo, V.: Solving weighted max-sat via global equilibrium search. Oper. Res. Lett., 434\u2013438 (2008)","DOI":"10.1016\/j.orl.2007.11.007"},{"key":"28_CR20","unstructured":"Resende, M.: Algorithm source code distribution, \n                    \n                      http:\/\/research.att.com\/~mgcr\/src\n                    \n                    \n                   (last accessed on October 2008)"},{"key":"28_CR21","unstructured":"Resende, M.: Test problem distribution, \n                    \n                      http:\/\/research.att.com\/~mgcr\/data\n                    \n                    \n                   (last accessed on October 2008)"},{"key":"28_CR22","unstructured":"Yagiura, M.: Benchmark instances and program codes for max sat, \n                    \n                      http:\/\/www.al.cm.is.nagoya-u.ac.jp\/~yagiura\/msat.html\n                    \n                    \n                   (last accessed on October 2008)"},{"key":"28_CR23","unstructured":"Mills, P.: Constraint programming and optimization laboratory, university of essex, gls solver, algorithm: Extended gls, \n                    \n                      http:\/\/cswww.essex.ac.uk\/CSP\/glsdemo.html\n                    \n                    \n                   (last accessed on October 2008)"},{"key":"28_CR24","unstructured":"Pardalos, P., Wolkowicz, H.: Quadratic assignment and related problems: DIMACS Workshop, May 20-21, vol.\u00a016. Amer. Mathematical Society (1994)"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Burkard, R., Cela, E., Pitsoulis, L., Pardalos, P.M.: The quadratic assignment problem. In: Handbook of Combinatorial Optimization, vol.\u00a03, pp. 241\u2013337. Springer (1998)","DOI":"10.1007\/978-1-4613-0303-9_27"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Pardalos, P., Pitsoulis, L.: Nonlinear assignment problems: algorithms and applications, vol.\u00a07. Kluwer Academic Pub. (2000)","DOI":"10.1007\/978-1-4757-3155-2"},{"issue":"4","key":"28_CR27","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R.E. Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: Qaplib\u2013a quadratic assignment problem library. Journal of Global Optimization\u00a010(4), 391\u2013403 (1997)","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"28_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10589-005-4562-x","volume":"30","author":"A. Misevicius","year":"2005","unstructured":"Misevicius, A.: A tabu search algorithm for the quadratic assignment problem. Computational Optimization and Applications\u00a030(1), 95\u2013111 (2005)","journal-title":"Computational Optimization and Applications"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN XII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32964-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:50:19Z","timestamp":1620129019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32964-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329630","9783642329647"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32964-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}