{"id":"https://openalex.org/W2894231282","doi":"https://doi.org/10.48550/arxiv.cs/0407044","title":"Reduced cost-based ranking for generating promising subproblems","display_name":"Reduced cost-based ranking for generating promising subproblems","publication_year":2004,"publication_date":"2004-07-16","ids":{"openalex":"https://openalex.org/W2894231282","doi":"https://doi.org/10.48550/arxiv.cs/0407044","mag":"2894231282"},"language":"en","primary_location":{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/adf13767-54f6-4bde-b1e1-7939fcbd6ced","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/reduced-costbased-ranking-for-generating-promising-subproblems(adf13767-54f6-4bde-b1e1-7939fcbd6ced).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Milano, M & van Hoeve, W J 2002, Reduced cost-based ranking for generating promising subproblems. in Proceedings of the Joint ERCIM/CologNet Workshop on Constraint Solving and Constraint Logic Programming. pp. 7-22.","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0407044","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Milano, M.","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Milano, M.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5049170163","display_name":"Willem\u2010Jan van Hoeve","orcid":"https://orcid.org/0000-0002-0023-753X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van Hoeve, W. J.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.7609000205993652,"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.7609000205993652,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.029999999329447746,"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/T11106","display_name":"Data Management and Algorithms","score":0.014499999582767487,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/ranking","display_name":"Ranking (information retrieval)","score":0.8402987718582153},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7765499353408813},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6398980021476746},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.6360116004943848},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.617942750453949},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5628845691680908},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.545899510383606},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.43287771940231323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35253584384918213},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22342124581336975},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21840780973434448}],"concepts":[{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.8402987718582153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7765499353408813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6398980021476746},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.6360116004943848},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.617942750453949},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5628845691680908},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.545899510383606},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.43287771940231323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35253584384918213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22342124581336975},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21840780973434448},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/adf13767-54f6-4bde-b1e1-7939fcbd6ced","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/reduced-costbased-ranking-for-generating-promising-subproblems(adf13767-54f6-4bde-b1e1-7939fcbd6ced).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Milano, M & van Hoeve, W J 2002, Reduced cost-based ranking for generating promising subproblems. in Proceedings of the Joint ERCIM/CologNet Workshop on Constraint Solving and Constraint Logic Programming. pp. 7-22.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:cs/0407044","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0407044","pdf_url":"https://arxiv.org/pdf/cs/0407044","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.2831","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.2831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.cwi.nl/~wjvh/papers/ercim02.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.8849","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.8849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.cwi.nl/~wjvh/papers/cp02.pdf","raw_type":"text"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/11ebe792-e6a1-4bed-95f3-e7b87bc20153","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/reduced-costbased-ranking-for-generating-promising-subproblems(11ebe792-e6a1-4bed-95f3-e7b87bc20153).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Milano, M & van Hoeve, W J 2002, 'Reduced cost-based ranking for generating promising subproblems', Lecture Notes in Computer Science, vol. 2470, pp. 1-16.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/11ebe792-e6a1-4bed-95f3-e7b87bc20153","is_oa":false,"landing_page_url":"http://dare.uva.nl/personal/pure/en/publications/reduced-costbased-ranking-for-generating-promising-subproblems(11ebe792-e6a1-4bed-95f3-e7b87bc20153).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Milano, M & van Hoeve, W J 2002, 'Reduced cost-based ranking for generating promising subproblems', Lecture Notes in Computer Science, vol. 2470, pp. 1-16.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/11ebe792-e6a1-4bed-95f3-e7b87bc20153","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/reduced-costbased-ranking-for-generating-promising-subproblems(11ebe792-e6a1-4bed-95f3-e7b87bc20153).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science, 2470, 1 - 16. Springer Verlag","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/adf13767-54f6-4bde-b1e1-7939fcbd6ced","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/reduced-costbased-ranking-for-generating-promising-subproblems(adf13767-54f6-4bde-b1e1-7939fcbd6ced).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Joint ERCIM/CologNet Workshop on Constraint Solving and Constraint Logic Programming, 7 - 22","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"doi:10.48550/arxiv.cs/0407044","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.cs/0407044","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0407044","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0407044","pdf_url":"https://arxiv.org/pdf/cs/0407044","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1574934390","https://openalex.org/W1508252429","https://openalex.org/W1998707332","https://openalex.org/W1973834849","https://openalex.org/W1999666034","https://openalex.org/W2081570649","https://openalex.org/W2045173407","https://openalex.org/W2109405343","https://openalex.org/W2078027863","https://openalex.org/W1980201624","https://openalex.org/W3022768451","https://openalex.org/W2017372614","https://openalex.org/W2070484240","https://openalex.org/W1755312702","https://openalex.org/W2066558813","https://openalex.org/W1964440694","https://openalex.org/W2055775959","https://openalex.org/W1981245140","https://openalex.org/W1978177608","https://openalex.org/W1971327934"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,40,97],"propose":[4],"an":[5],"effective":[6],"search":[7],"procedure":[8],"that":[9,57,65,87],"interleaves":[10],"two":[11],"steps:":[12],"subproblem":[13,16],"generation":[14],"and":[15,118],"solution.":[17],"We":[18,111],"mainly":[19],"focus":[20],"on":[21,34,115],"the":[22,38,48,71,75,89,93,103,116,125,128,132],"first":[23,76],"part.":[24],"It":[25],"consists":[26],"of":[27,88,95,127],"a":[28,43,61,99],"variable":[29],"domain":[30],"value":[31],"ranking":[32,64],"based":[33],"reduced":[35,58],"costs.":[36],"Exploiting":[37],"ranking,":[39],"generate,":[41],"in":[42,74],"Limited":[44],"Discrepancy":[45],"Search":[46],"tree,":[47],"most":[49],"promising":[50],"subproblems":[51,107],"first.":[52],"An":[53],"interesting":[54],"result":[55],"is":[56,83],"costs":[59],"provide":[60],"very":[62],"precise":[63],"allows":[66],"to":[67,101,123],"almost":[68],"always":[69],"find":[70],"optimal":[72],"solution":[73],"generated":[77],"subproblem,":[78],"even":[79],"if":[80],"its":[81,119],"dimension":[82],"significantly":[84],"smaller":[85],"than":[86],"original":[90],"problem.":[91],"Concerning":[92],"proof":[94],"optimality,":[96],"exploit":[98],"way":[100],"increase":[102],"lower":[104],"bound":[105],"for":[106,137],"at":[108],"higher":[109],"discrepancies.":[110],"show":[112,124],"experimental":[113],"results":[114],"TSP":[117],"time":[120],"constrained":[121],"variant":[122],"effectiveness":[126],"proposed":[129],"approach,":[130],"but":[131],"technique":[133],"could":[134],"be":[135],"generalized":[136],"other":[138],"problems.":[139]},"counts_by_year":[],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2025-10-10T00:00:00"}