{"id":"https://openalex.org/W2049225325","doi":"https://doi.org/10.1007/s11590-011-0288-0","title":"A breakpoint search approach for convex resource allocation problems with bounded variables","display_name":"A breakpoint search approach for convex resource allocation problems with bounded variables","publication_year":2011,"publication_date":"2011-02-12","ids":{"openalex":"https://openalex.org/W2049225325","doi":"https://doi.org/10.1007/s11590-011-0288-0","mag":"2049225325"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-011-0288-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-011-0288-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-011-0288-0.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","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/s11590-011-0288-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020785576","display_name":"Anja De Waegenaere","orcid":"https://orcid.org/0000-0001-7396-3789"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Anja De Waegenaere","raw_affiliation_strings":["CentER for Economic Research and Department of Econometrics and Operations Research, Tilburg University, P.O. Box 90153, 5000 LE, Tilburg, The Netherlands","(Tilburg University)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CentER for Economic Research and Department of Econometrics and Operations Research, Tilburg University, P.O. Box 90153, 5000 LE, Tilburg, The Netherlands","institution_ids":["https://openalex.org/I193700539"]},{"raw_affiliation_string":"(Tilburg University)","institution_ids":["https://openalex.org/I193700539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075629407","display_name":"Jacco L. Wielhouwer","orcid":"https://orcid.org/0000-0002-0509-0602"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jacco L. Wielhouwer","raw_affiliation_strings":["Department of Accounting, Faculty of Economics, VU University Amsterdam, Room 2E-31, De Boelelaan 1105, 1081 HV, Amsterdam, The Netherlands","VU University Amsterdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Accounting, Faculty of Economics, VU University Amsterdam, Room 2E-31, De Boelelaan 1105, 1081 HV, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]},{"raw_affiliation_string":"VU University Amsterdam","institution_ids":["https://openalex.org/I865915315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020785576"],"corresponding_institution_ids":["https://openalex.org/I193700539"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.3657,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.64164057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":"4","first_page":"629","last_page":"640"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.996999979019165,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9965000152587891,"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/bounded-function","display_name":"Bounded function","score":0.6523045301437378},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.6269471645355225},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6110832691192627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5585505962371826},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5299502611160278},{"id":"https://openalex.org/keywords/computational-intelligence","display_name":"Computational intelligence","score":0.495355486869812},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4526491165161133},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.44753292202949524},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4307671785354614},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.42544952034950256},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4142616391181946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3887161612510681},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10302498936653137}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6523045301437378},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.6269471645355225},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6110832691192627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5585505962371826},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5299502611160278},{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.495355486869812},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4526491165161133},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.44753292202949524},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4307671785354614},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.42544952034950256},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4142616391181946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3887161612510681},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10302498936653137},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s11590-011-0288-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-011-0288-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-011-0288-0.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:publications/4feefccd-e7bb-46c9-9028-2ab3af0193fe","is_oa":false,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/4feefccd-e7bb-46c9-9028-2ab3af0193fe","pdf_url":null,"source":{"id":"https://openalex.org/S4406923027","display_name":"Tilburg University Research Portal","issn_l":null,"issn":null,"is_oa":false,"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"De Waegenaere, A M B & Wielhouwer, J L 2012, 'A breakpoint search approach for convex resource allocation problems with bounded variables', Optimization Letters, vol. 6, no. 4, pp. 629-640. https://doi.org/10.1007/s11590-011-0288-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:vu:oai:research.vu.nl:publications/73476c00-a340-460d-9711-a8ecc38397a4","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/73476c00-a340-460d-9711-a8ecc38397a4","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":"Optimization Letters, 6(4), 629 - 640. Springer Verlag","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s11590-011-0288-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11590-011-0288-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11590-011-0288-0.pdf","source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"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":"Optimization Letters","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2049225325.pdf","grobid_xml":"https://content.openalex.org/works/W2049225325.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1967103686","https://openalex.org/W1969757890","https://openalex.org/W1978119584","https://openalex.org/W1987755233","https://openalex.org/W1991609653","https://openalex.org/W1995359879","https://openalex.org/W1999244290","https://openalex.org/W2024574812","https://openalex.org/W2032188820","https://openalex.org/W2039719565","https://openalex.org/W2061211758","https://openalex.org/W2062677144","https://openalex.org/W2066921519","https://openalex.org/W2086427885","https://openalex.org/W2101957348","https://openalex.org/W2118402343","https://openalex.org/W2141561565","https://openalex.org/W2143277915","https://openalex.org/W2144535096","https://openalex.org/W2167664808"],"related_works":["https://openalex.org/W2186899668","https://openalex.org/W4366458941","https://openalex.org/W3185187499","https://openalex.org/W2409606037","https://openalex.org/W2085486022","https://openalex.org/W2167664808","https://openalex.org/W2992250528","https://openalex.org/W1516673392","https://openalex.org/W4297899479","https://openalex.org/W2981240644"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"efficient":[3],"approach":[4],"to":[5,67],"solve":[6],"resource":[7],"allocation":[8],"problems":[9],"with":[10,75],"a":[11,14,19,33,72,83],"single":[12],"resource,":[13],"convex":[15,20],"separable":[16,21],"objective":[17],"function,":[18],"resource-usage":[22],"constraint,":[23],"and":[24,30,38,48,62],"variables":[25],"that":[26],"are":[27,50],"bounded":[28],"below":[29],"above.":[31],"Through":[32],"combination":[34],"of":[35,71,103],"function":[36],"evaluations":[37],"median":[39],"searches,":[40],"information":[41,56,88],"on":[42],"whether":[43],"or":[44],"not":[45],"the":[46,69,95,101],"upper-":[47],"lowerbounds":[49],"binding":[51],"is":[52,57],"obtained.":[53],"Once":[54],"this":[55,104],"available":[58],"for":[59,91,94],"all":[60],"upper":[61],"lower":[63],"bounds,":[64],"it":[65],"remains":[66],"determine":[68],"optimum":[70],"smaller":[73],"problem":[74],"unbounded":[76],"variables.":[77],"This":[78],"can":[79,99],"be":[80],"done":[81],"through":[82],"multiplier":[84,96],"search":[85,97],"procedure.":[86,105],"The":[87],"gathered":[89],"allows":[90],"alternative":[92],"approaches":[93],"which":[98],"reduce":[100],"complexity":[102]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}