{"id":"https://openalex.org/W2077894211","doi":"https://doi.org/10.1007/s10898-011-9771-5","title":"On estimating workload in interval branch-and-bound global optimization algorithms","display_name":"On estimating workload in interval branch-and-bound global optimization algorithms","publication_year":2011,"publication_date":"2011-09-06","ids":{"openalex":"https://openalex.org/W2077894211","doi":"https://doi.org/10.1007/s10898-011-9771-5","mag":"2077894211"},"language":"en","primary_location":{"id":"doi:10.1007/s10898-011-9771-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-011-9771-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-011-9771-5.pdf","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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","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":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10898-011-9771-5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030713810","display_name":"Jos\u00e9 L. Berenguel","orcid":null},"institutions":[{"id":"https://openalex.org/I52354020","display_name":"University of Almer\u00eda","ror":"https://ror.org/003d3xx08","country_code":"ES","type":"education","lineage":["https://openalex.org/I52354020"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 L. Berenguel","raw_affiliation_strings":["TIC 146: \u201cSupercomputing\u2013Algorithms\u201d Research group, University of Almer\u00eda, Almer\u00eda, Spain","[University of Almer\u00eda]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TIC 146: \u201cSupercomputing\u2013Algorithms\u201d Research group, University of Almer\u00eda, Almer\u00eda, Spain","institution_ids":["https://openalex.org/I52354020"]},{"raw_affiliation_string":"[University of Almer\u00eda]","institution_ids":["https://openalex.org/I52354020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056739213","display_name":"L. G. Casado","orcid":"https://orcid.org/0000-0001-8459-4982"},"institutions":[{"id":"https://openalex.org/I52354020","display_name":"University of Almer\u00eda","ror":"https://ror.org/003d3xx08","country_code":"ES","type":"education","lineage":["https://openalex.org/I52354020"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"L. G. Casado","raw_affiliation_strings":["Computer Architecture and Electronics Department, University of Almer\u00eda, Almer\u00eda, Spain","[University of Almer\u00eda]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Architecture and Electronics Department, University of Almer\u00eda, Almer\u00eda, Spain","institution_ids":["https://openalex.org/I52354020"]},{"raw_affiliation_string":"[University of Almer\u00eda]","institution_ids":["https://openalex.org/I52354020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065759704","display_name":"I. Garc\u00eda","orcid":"https://orcid.org/0000-0002-1138-2118"},"institutions":[{"id":"https://openalex.org/I82767444","display_name":"Universidad de M\u00e1laga","ror":"https://ror.org/036b2ww28","country_code":"ES","type":"education","lineage":["https://openalex.org/I82767444"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"I. Garc\u00eda","raw_affiliation_strings":["Computer Architecture Department, University of M\u00e1laga, M\u00e1laga, Spain","University of Malaga,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Architecture Department, University of M\u00e1laga, M\u00e1laga, Spain","institution_ids":["https://openalex.org/I82767444"]},{"raw_affiliation_string":"University of Malaga,","institution_ids":["https://openalex.org/I82767444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049141591","display_name":"E.M.T. Hendrix","orcid":"https://orcid.org/0000-0003-1572-1436"},"institutions":[{"id":"https://openalex.org/I82767444","display_name":"Universidad de M\u00e1laga","ror":"https://ror.org/036b2ww28","country_code":"ES","type":"education","lineage":["https://openalex.org/I82767444"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Eligius M. T. Hendrix","raw_affiliation_strings":["Computer Architecture Department, University of M\u00e1laga, M\u00e1laga, Spain","University of Malaga,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Architecture Department, University of M\u00e1laga, M\u00e1laga, Spain","institution_ids":["https://openalex.org/I82767444"]},{"raw_affiliation_string":"University of Malaga,","institution_ids":["https://openalex.org/I82767444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2780},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2780},"fwci":0.9784,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.76457235,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"56","issue":"3","first_page":"821","last_page":"844"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.7807201147079468},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.7348626852035522},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6724579334259033},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6370248198509216},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5397307872772217},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4809638559818268},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.474748432636261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4624977111816406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45653802156448364},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45606672763824463},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4437282383441925},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.404153048992157},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.28545093536376953},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07157847285270691}],"concepts":[{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.7807201147079468},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7348626852035522},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6724579334259033},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6370248198509216},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5397307872772217},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4809638559818268},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.474748432636261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4624977111816406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45653802156448364},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45606672763824463},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4437282383441925},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.404153048992157},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28545093536376953},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07157847285270691},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10898-011-9771-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-011-9771-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-011-9771-5.pdf","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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jglopt:v:56:y:2013:i:3:p:821-844","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1007/s10898-011-9771-5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"},{"id":"pmh:wur:oai:library.wur.nl:wurpubs/411207","is_oa":true,"landing_page_url":"https://research.wur.nl/en/publications/on-estimating-workload-in-branch-and-bound-global-optimization-al","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Global Optimization, 56(3), 821 - 844","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10898-011-9771-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10898-011-9771-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10898-011-9771-5.pdf","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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Global Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4099999964237213}],"awards":[{"id":"https://openalex.org/G6059000486","display_name":null,"funder_award_id":"P08-TIC-3518","funder_id":"https://openalex.org/F4320326754","funder_display_name":"Junta de Andaluc\u00eda"},{"id":"https://openalex.org/G6844692841","display_name":null,"funder_award_id":"TIN2008-01117","funder_id":"https://openalex.org/F4320322930","funder_display_name":"Ministerio de Ciencia e Innovaci\u00f3n"}],"funders":[{"id":"https://openalex.org/F4320322930","display_name":"Ministerio de Ciencia e Innovaci\u00f3n","ror":"https://ror.org/034900433"},{"id":"https://openalex.org/F4320326754","display_name":"Junta de Andaluc\u00eda","ror":"https://ror.org/01jem9c82"},{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2077894211.pdf","grobid_xml":"https://content.openalex.org/works/W2077894211.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W66558573","https://openalex.org/W124176502","https://openalex.org/W586905696","https://openalex.org/W630231262","https://openalex.org/W1483874187","https://openalex.org/W1507872748","https://openalex.org/W1517206491","https://openalex.org/W1536499179","https://openalex.org/W1573128395","https://openalex.org/W1770680610","https://openalex.org/W1963764014","https://openalex.org/W1982147057","https://openalex.org/W1984263429","https://openalex.org/W2005234139","https://openalex.org/W2012879099","https://openalex.org/W2031960564","https://openalex.org/W2048801726","https://openalex.org/W2052675170","https://openalex.org/W2060032012","https://openalex.org/W2064828380","https://openalex.org/W2067648572","https://openalex.org/W2091364465","https://openalex.org/W2095522801","https://openalex.org/W2106144871","https://openalex.org/W2108334735","https://openalex.org/W2117003742","https://openalex.org/W2123241324","https://openalex.org/W2135937941","https://openalex.org/W2317988884","https://openalex.org/W2326486374","https://openalex.org/W2610216665","https://openalex.org/W3102098597","https://openalex.org/W3146520007","https://openalex.org/W4230870880","https://openalex.org/W4240374930","https://openalex.org/W4254772338","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2052598152","https://openalex.org/W2390710122","https://openalex.org/W2742829479","https://openalex.org/W1997215277","https://openalex.org/W2086205578","https://openalex.org/W1998028886","https://openalex.org/W3169085602","https://openalex.org/W3159511877","https://openalex.org/W2077894211","https://openalex.org/W4312121787"],"abstract_inverted_index":{"In":[0,81],"general,":[1],"solving":[2],"Global":[3],"Optimization":[4],"(GO)":[5],"problems":[6],"by":[7],"Branch-and-Bound":[8],"(B&B)":[9],"requires":[10],"a":[11,76],"huge":[12],"computational":[13,33,114],"capacity.":[14],"Parallel":[15],"execution":[16],"is":[17,56],"used":[18],"to":[19,63,72,88],"speed":[20],"up":[21],"the":[22,31,39,45,47,51,60,65,90,95,104,109,112],"computing":[23],"time.":[24],"As":[25],"in":[26,38],"this":[27,82],"type":[28],"of":[29,36,67,98,108],"algorithms,":[30],"foreseen":[32],"workload":[34],"(number":[35],"nodes":[37,68],"B&B":[40,123],"tree)":[41],"changes":[42],"dynamically":[43],"during":[44,79],"execution,":[46],"load":[48],"balancing":[49],"and":[50,111],"decision":[52],"on":[53,94,118],"additional":[54],"processors":[55],"complicated.":[57],"We":[58,116],"use":[59,120],"term":[61],"left-over":[62,91],"represent":[64],"number":[66],"that":[69],"still":[70],"have":[71],"be":[73],"evaluated":[74],"at":[75],"certain":[77],"moment":[78],"execution.":[80],"work,":[83],"we":[84],"study":[85],"new":[86],"methods":[87],"estimate":[89],"value":[92],"based":[93],"observed":[96],"amount":[97],"pruning.":[99],"This":[100],"provides":[101],"information":[102],"about":[103],"remaining":[105],"running":[106],"time":[107],"algorithm":[110],"required":[113],"resources.":[115],"focus":[117],"their":[119],"for":[121],"interval":[122],"GO":[124],"algorithms.":[125]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}