{"id":"https://openalex.org/W1598317541","doi":"https://doi.org/10.1023/a:1016246616462","title":"Search Heuristics for Box Decomposition Methods","display_name":"Search Heuristics for Box Decomposition Methods","publication_year":2002,"publication_date":"2002-09-01","ids":{"openalex":"https://openalex.org/W1598317541","doi":"https://doi.org/10.1023/a:1016246616462","mag":"1598317541"},"language":"en","primary_location":{"id":"doi:10.1023/a:1016246616462","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1016246616462","pdf_url":null,"source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025056965","display_name":"Stefan Ratschan","orcid":"https://orcid.org/0000-0003-1710-1513"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Stefan Ratschan","raw_affiliation_strings":["Research Institute for Symbolic Computation, Johannes Kepler Universit\u00e4t Linz, A-4040, Linz, Austria","Research Institute for Symbolic Computation, Johannes Kepler Universit\u00e4t Linz, A-4040 Linz, Austria (e-mail: stefan.ratschan@risc.uni-linz.ac.at)#TAB#"],"affiliations":[{"raw_affiliation_string":"Research Institute for Symbolic Computation, Johannes Kepler Universit\u00e4t Linz, A-4040, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]},{"raw_affiliation_string":"Research Institute for Symbolic Computation, Johannes Kepler Universit\u00e4t Linz, A-4040 Linz, Austria (e-mail: stefan.ratschan@risc.uni-linz.ac.at)#TAB#","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025056965"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":null,"fwci":2.7764,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92213316,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"1","first_page":"35","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.8320111036300659},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6894257068634033},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6596550345420837},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.626655101776123},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5772426128387451},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5619051456451416},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.49237048625946045}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8320111036300659},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6894257068634033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6596550345420837},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.626655101776123},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5772426128387451},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5619051456451416},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.49237048625946045},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1016246616462","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1016246616462","pdf_url":null,"source":{"id":"https://openalex.org/S115925768","display_name":"Journal of Global Optimization","issn_l":"0925-5001","issn":["0925-5001","1573-2916"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W296311487","https://openalex.org/W1504204411","https://openalex.org/W1511783970","https://openalex.org/W1513182422","https://openalex.org/W1540125941","https://openalex.org/W1554631849","https://openalex.org/W1554955666","https://openalex.org/W1558198085","https://openalex.org/W1570787829","https://openalex.org/W1579484017","https://openalex.org/W1606142188","https://openalex.org/W1607173467","https://openalex.org/W1610912307","https://openalex.org/W1646038686","https://openalex.org/W1867321338","https://openalex.org/W1970677796","https://openalex.org/W1971806437","https://openalex.org/W1982977005","https://openalex.org/W1985614781","https://openalex.org/W1994738145","https://openalex.org/W1998437683","https://openalex.org/W2009029907","https://openalex.org/W2019928791","https://openalex.org/W2022125816","https://openalex.org/W2029381483","https://openalex.org/W2031423586","https://openalex.org/W2036670922","https://openalex.org/W2042192317","https://openalex.org/W2044354687","https://openalex.org/W2048801726","https://openalex.org/W2055604481","https://openalex.org/W2066341441","https://openalex.org/W2078414169","https://openalex.org/W2081821176","https://openalex.org/W2083514324","https://openalex.org/W2088182101","https://openalex.org/W2095410456","https://openalex.org/W2103054960","https://openalex.org/W2111304450","https://openalex.org/W2124622524","https://openalex.org/W2129480103","https://openalex.org/W2134028782","https://openalex.org/W2134634502","https://openalex.org/W2144931885","https://openalex.org/W2152475379","https://openalex.org/W2154417328","https://openalex.org/W2159543372","https://openalex.org/W2167206762","https://openalex.org/W2272795305","https://openalex.org/W2403711553","https://openalex.org/W2906824576","https://openalex.org/W2914693551","https://openalex.org/W2954327716","https://openalex.org/W3146520007","https://openalex.org/W4247032301","https://openalex.org/W4253631849","https://openalex.org/W6602610759"],"related_works":["https://openalex.org/W2390815705","https://openalex.org/W2330487432","https://openalex.org/W2153629319","https://openalex.org/W2104316494","https://openalex.org/W239705756","https://openalex.org/W156119379","https://openalex.org/W2082139080","https://openalex.org/W4231015910","https://openalex.org/W2364847091","https://openalex.org/W1547852488"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}