{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:12:35Z","timestamp":1765231955771},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Algebra Comput."],"published-print":{"date-parts":[[2012,3]]},"abstract":"<jats:p> Attempts have been made to eliminate some potential counterexamples to the Andrews\u2013Curtis conjecture using the combinatorial optimization methods of blind-search and the genetic algorithms meta-heuristic. Breadth-first search with secondary storage is currently the most successful method, which raises questions regarding the inferior performance of heuristic search. In order to understand the underlying reasons we obtain fitness landscape metrics for a number of balanced presentations and draw conclusions regarding the likely effectiveness of other meta-heuristics. <\/jats:p>","DOI":"10.1142\/s0218196711006753","type":"journal-article","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T21:38:15Z","timestamp":1313012295000},"page":"1250009","source":"Crossref","is-referenced-by-count":3,"title":["FITNESS LANDSCAPES AND THE ANDREWS\u2013CURTIS CONJECTURE"],"prefix":"10.1142","volume":"22","author":[{"given":"JERRY","family":"SWAN","sequence":"first","affiliation":[{"name":"Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science and Information Technology, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GABRIELA","family":"OCHOA","sequence":"additional","affiliation":[{"name":"Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science and Information Technology, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GRAHAM","family":"KENDALL","sequence":"additional","affiliation":[{"name":"Automated Scheduling, Optimisation and Planning (ASAP) Research Group, School of Computer Science and Information Technology, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARTIN","family":"EDJVET","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, University of Nottingham, University Park, Nottingham, NG7 2RD, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0040-9383(85)90010-2"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1965-0173241-8"},{"key":"rf3","series-title":"Operations Research\/Computer Science Interfaces Series","volume-title":"Reactive Search and Intelligent Optimization","volume":"45","author":"Battiti R.","year":"2008"},{"key":"rf4","volume":"15","author":"Bowman R. S.","journal-title":"Experiment. Math."},{"key":"rf5","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"Gusfield D.","year":"2007"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196703001365"},{"key":"rf7","volume-title":"Stochastic Local Search: Foundations & Applications","author":"Hoos H.","year":"2004"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.4.335"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04448-3_8"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568103"},{"key":"rf13","unstructured":"P.\u00a0Merz and B.\u00a0Freisleben, New Ideas in Optimization (McGraw-Hill, 1999)\u00a0pp. 245\u2013260."},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196799000370"},{"key":"rf15","unstructured":"A. D.\u00a0Miasnikov and A. G.\u00a0Myasnikov, Groups and Computation III\u00a023, eds. W.\u00a0Kantor and A.\u00a0Seress (de Gruyter Berlin, 2003)\u00a0pp. 257\u2013263."},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006343127545"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/296\/05074"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2009.0193"},{"key":"rf19","unstructured":"P.\u00a0Schupp and C. F.\u00a0Miller\u00a0III, Groups, Languages and Automata, Contemporary Mathematics\u00a0250, ed. R.\u00a0Gilman (American Mathematical Society, Providence, RI, 1999)\u00a0pp. 113\u2013115."},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00202749"}],"container-title":["International Journal of Algebra and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218196711006753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T08:40:42Z","timestamp":1565167242000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218196711006753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":18,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2012,3]]}},"alternative-id":["10.1142\/S0218196711006753"],"URL":"https:\/\/doi.org\/10.1142\/s0218196711006753","relation":{},"ISSN":["0218-1967","1793-6500"],"issn-type":[{"value":"0218-1967","type":"print"},{"value":"1793-6500","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}