{"id":"https://openalex.org/W2075706745","doi":"https://doi.org/10.1017/s0963548304006650","title":"On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics","display_name":"On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2075706745","doi":"https://doi.org/10.1017/s0963548304006650","mag":"2075706745"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548304006650","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548304006650","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B3630DDE6AE83F5A67716BD1BE28DBE6/S0963548304006650a.pdf/div-class-title-on-the-optimization-of-monotone-polynomials-by-simple-randomized-search-heuristics-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B3630DDE6AE83F5A67716BD1BE28DBE6/S0963548304006650a.pdf/div-class-title-on-the-optimization-of-monotone-polynomials-by-simple-randomized-search-heuristics-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075262791","display_name":"Ingo Wegener","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"INGO WEGENER","raw_affiliation_strings":["FB Informatik, LS 2, Universit\u00e4t Dortmund, 44221 Dortmund, Germany (e-mail:","FB Informatik, LS 2, Universit\u00e4t Dortmund, 44221 Dortmund, Germany (e-mail: wegener@ls2.cs.uni-dortmund.de, witt@ls2.cs.uni-dortmund.de)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FB Informatik, LS 2, Universit\u00e4t Dortmund, 44221 Dortmund, Germany (e-mail:","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"FB Informatik, LS 2, Universit\u00e4t Dortmund, 44221 Dortmund, Germany (e-mail: wegener@ls2.cs.uni-dortmund.de, witt@ls2.cs.uni-dortmund.de)","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038689623","display_name":"Carsten Witt","orcid":"https://orcid.org/0000-0002-6105-7700"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"CARSTEN WITT","raw_affiliation_strings":["FB Informatik, LS 2, Universit\u00e4t Dortmund, 44221 Dortmund, Germany (e-mail:","FB Informatik, LS 2, Universit\u00e4t Dortmund, 44221 Dortmund, Germany (e-mail: wegener@ls2.cs.uni-dortmund.de, witt@ls2.cs.uni-dortmund.de)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FB Informatik, LS 2, Universit\u00e4t Dortmund, 44221 Dortmund, Germany (e-mail:","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"FB Informatik, LS 2, Universit\u00e4t Dortmund, 44221 Dortmund, Germany (e-mail: wegener@ls2.cs.uni-dortmund.de, witt@ls2.cs.uni-dortmund.de)","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":8.653,"has_fulltext":true,"cited_by_count":67,"citation_normalized_percentile":{"value":0.97593014,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":"1-2","first_page":"225","last_page":"247"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7390447854995728},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7146062850952148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6834757924079895},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5392441153526306},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5222852230072021},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4995243549346924},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.48797792196273804},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4769227206707001},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4389650821685791},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.41935139894485474},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41038841009140015},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38685303926467896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3438015580177307},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34098586440086365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3042023479938507},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11807864904403687}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7390447854995728},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7146062850952148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6834757924079895},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5392441153526306},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5222852230072021},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4995243549346924},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.48797792196273804},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4769227206707001},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4389650821685791},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41935139894485474},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41038841009140015},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38685303926467896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3438015580177307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34098586440086365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3042023479938507},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11807864904403687},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1017/s0963548304006650","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548304006650","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B3630DDE6AE83F5A67716BD1BE28DBE6/S0963548304006650a.pdf/div-class-title-on-the-optimization-of-monotone-polynomials-by-simple-randomized-search-heuristics-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.11.5765","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.5765","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sfbci.cs.uni-dortmund.de/home/English/Publications/Reference/Downloads/WW02.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.323.7110","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.323.7110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sfbci.uni-dortmund.de/Publications/Reference/Downloads/WW18102002.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.8.3790","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.3790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ls2-www.cs.uni-dortmund.de/%7Ewegener/papers/monotone-polynomials.ps","raw_type":"text"},{"id":"pmh:oai:eldorado.tu-dortmund.de:2003/5425","is_oa":false,"landing_page_url":"http://hdl.handle.net/2003/5425","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doc-type:report"},{"id":"doi:10.17877/de290r-5641","is_oa":true,"landing_page_url":"https://doi.org/10.17877/de290r-5641","pdf_url":null,"source":{"id":"https://openalex.org/S4306400811","display_name":"Technische Universit\u00e4t Dortmund Eldorado (Technische Universit\u00e4t Dortmund)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210148506","host_organization_name":"Erich-Brost-Institut","host_organization_lineage":["https://openalex.org/I4210148506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"report"}],"best_oa_location":{"id":"doi:10.1017/s0963548304006650","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548304006650","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B3630DDE6AE83F5A67716BD1BE28DBE6/S0963548304006650a.pdf/div-class-title-on-the-optimization-of-monotone-polynomials-by-simple-randomized-search-heuristics-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3171094092","display_name":null,"funder_award_id":"SFB 531","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2075706745.pdf","grobid_xml":"https://content.openalex.org/works/W2075706745.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W173807375","https://openalex.org/W270296773","https://openalex.org/W372717656","https://openalex.org/W1527462214","https://openalex.org/W1606499289","https://openalex.org/W1606774760","https://openalex.org/W1983804795","https://openalex.org/W1985318592","https://openalex.org/W1994258343","https://openalex.org/W1996375957","https://openalex.org/W2061092014","https://openalex.org/W2084149434","https://openalex.org/W2107951961","https://openalex.org/W2142509348","https://openalex.org/W2165220807","https://openalex.org/W2166897600","https://openalex.org/W2167359818","https://openalex.org/W2295428206","https://openalex.org/W2751862591","https://openalex.org/W3121530892","https://openalex.org/W4231087806","https://openalex.org/W4247849388","https://openalex.org/W4299432846","https://openalex.org/W6665601915","https://openalex.org/W6684434985","https://openalex.org/W6697355399","https://openalex.org/W7038906009"],"related_works":["https://openalex.org/W2084470113","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W4312926500","https://openalex.org/W2067280619","https://openalex.org/W4251343851"],"abstract_inverted_index":{"Randomized":[0],"search":[1,111,118,124],"heuristics":[2,31],"like":[3],"evolutionary":[4],"algorithms":[5],"and":[6,62],"simulated":[7],"annealing":[8],"find":[9,108],"many":[10],"applications,":[11],"especially":[12],"in":[13,105],"situations":[14],"where":[15],"no":[16],"full":[17],"information":[18],"on":[19,40,59],"the":[20,51,60,63,68,98,102,127],"problem":[21],"instance":[22],"is":[23,34,47,77],"available.":[24],"In":[25],"order":[26,106],"to":[27,36,101,107,117],"understand":[28],"how":[29],"these":[30],"work,":[32],"it":[33,113],"necessary":[35,116],"analyse":[37],"their":[38],"behaviour":[39],"classes":[41],"of":[42,53,65,67,74,78,84,92,123],"functions.":[43],"Such":[44],"an":[45,89],"analysis":[46],"performed":[48],"here":[49],"for":[50],"class":[52,73],"monotone":[54,75],"pseudo-Boolean":[55],"polynomials.":[56],"Results":[57],"depending":[58],"degree":[61],"number":[64],"terms":[66],"polynomial":[69],"are":[70],"obtained.":[71],"The":[72],"polynomials":[76],"special":[79],"interest":[80],"since":[81],"simple":[82],"functions":[83],"this":[85],"kind":[86],"can":[87,96,114],"have":[88],"image":[90],"set":[91],"exponential":[93],"size,":[94],"improvements":[95],"increase":[97],"Hamming":[99],"distance":[100],"optimum":[103],"and,":[104],"a":[109,120],"better":[110],"point,":[112],"be":[115],"within":[119],"large":[121],"plateau":[122],"points":[125],"with":[126],"same":[128],"fitness":[129],"value.":[130]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}