{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:27:14Z","timestamp":1729614434154,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/foci.2011.5949471","type":"proceedings-article","created":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T16:01:59Z","timestamp":1310572919000},"page":"15-21","source":"Crossref","is-referenced-by-count":6,"title":["A study on the complexity of TSP instances under the 2-exchange neighbor system"],"prefix":"10.1109","author":[{"given":"Leticia","family":"Hernando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose A.","family":"Pascual","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Mendiburu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose A.","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04448-3_17"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00030-6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/435751a"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90049-9"},{"key":"ref14","first-page":"1","article-title":"On the number of local minima for the multidimensional assignment problem","volume":"1","author":"grundel","year":"2007","journal-title":"Journal of Combinatorial Optimization"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/3527606734"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00044-5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.08.001"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1126\/science.1073287","article-title":"Analytic and Algorithmic Solution of Random Satisfiability Problems","volume":"5582","author":"m\u00e9zard","year":"2002","journal-title":"Science 297"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1038\/22055","article-title":"Determining computational complexity from characteristic ‘phase transitions’","volume":"400","author":"monasson","year":"1999","journal-title":"Nature"},{"key":"ref4","first-page":"92","author":"codenotti","year":"1992","journal-title":"Local Properties of Some NP-complete Problems"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1613\/jair.1389","article-title":"Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem","volume":"21","author":"zhang","year":"2004","journal-title":"Journal of Artificial Intelligence Research"},{"key":"ref3","article-title":"Estimating the Number of Local Minima in Big, Nasty Search Spaces","author":"caruana","year":"0","journal-title":"Proceedings of the IJCAI-99 Workshop on Statistical Machine Learning for Large-Scale Optimization"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12139-5_5"},{"key":"ref5","article-title":"Fitness Distance Correlation, as Statistical Measure of Genetic Algorithm Difficulty, Revisited","author":"collard","year":"0","journal-title":"European Conference on Artificial Intelligence"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36605-9_21"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46004-7_4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00176-X"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03602"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/4235.843491"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.11.022"},{"article-title":"Combinatorial Optimization: Algorithms and Complexity","year":"1982","author":"papadimitriou","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.056701"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0103571"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389208"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.066114"}],"event":{"name":"2011 Ieee Symposium On Foundations Of Computational Intelligence - Part Of 17273 - 2011 Sscifo","start":{"date-parts":[[2011,4,11]]},"location":"Paris, France","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 IEEE Symposium on Foundations of Computational Intelligence (FOCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5938286\/5949460\/05949471.pdf?arnumber=5949471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T23:41:40Z","timestamp":1560382900000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5949471\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/foci.2011.5949471","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}