{"id":"https://openalex.org/W1577359755","doi":"https://doi.org/10.5860/choice.26-2176","title":"Resource allocation problems: algorithmic approaches","display_name":"Resource allocation problems: algorithmic approaches","publication_year":1988,"publication_date":"1988-12-01","ids":{"openalex":"https://openalex.org/W1577359755","doi":"https://doi.org/10.5860/choice.26-2176","mag":"1577359755"},"language":"en","primary_location":{"id":"doi:10.5860/choice.26-2176","doi":"https://doi.org/10.5860/choice.26-2176","is_oa":false,"landing_page_url":"https://doi.org/10.5860/choice.26-2176","pdf_url":null,"source":{"id":"https://openalex.org/S2764375719","display_name":"Choice Reviews Online","issn_l":"0009-4978","issn":["0009-4978","1523-8253","1943-5975"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310316146","host_organization_name":"Association of College and Research Libraries","host_organization_lineage":["https://openalex.org/P4310316146","https://openalex.org/P4310315903"],"host_organization_lineage_names":["Association of College and Research Libraries","American Library Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Choice Reviews Online","raw_type":"journal-article"},"volume":null,"type":"book-review","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":"04","first_page":"26","last_page":"2176"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9297000169754028,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9297000169754028,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.013700000010430813,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.01360000018030405,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/resource-allocation-problem","display_name":"resource allocation problem","score":0.8119999766349792},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9629999995231628},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":1.0},{"id":"https://openalex.org/keywords/fair-division","display_name":"fair division","score":0.8500000238418579},{"id":"https://openalex.org/keywords/apportionment","display_name":"apportionment","score":0.871999979019165},{"id":"https://openalex.org/keywords/nonlinear-integer-programming","display_name":"nonlinear integer programming","score":0.8330000042915344},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6650000214576721},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9589999914169312},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.7799999713897705},{"id":"https://openalex.org/keywords/load-distribution","display_name":"load distribution","score":0.7200000286102295},{"id":"https://openalex.org/keywords/production-planning","display_name":"production planning","score":0.8650000095367432},{"id":"https://openalex.org/keywords/computer-scheduling","display_name":"computer scheduling","score":0.8610000014305115},{"id":"https://openalex.org/keywords/portfolio-optimization","display_name":"portfolio optimization","score":0.9990000128746033}],"concepts":[{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6790993213653564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5740809440612793},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4361228942871094},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3681503236293793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19832167029380798},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08207952976226807}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5860/choice.26-2176","doi":"https://doi.org/10.5860/choice.26-2176","is_oa":false,"landing_page_url":"https://doi.org/10.5860/choice.26-2176","pdf_url":null,"source":{"id":"https://openalex.org/S2764375719","display_name":"Choice Reviews Online","issn_l":"0009-4978","issn":["0009-4978","1523-8253","1943-5975"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310316146","host_organization_name":"Association of College and Research Libraries","host_organization_lineage":["https://openalex.org/P4310316146","https://openalex.org/P4310315903"],"host_organization_lineage_names":["Association of College and Research Libraries","American Library Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Choice Reviews Online","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4211136162","https://openalex.org/W4302608771","https://openalex.org/W2725158825","https://openalex.org/W2188427771","https://openalex.org/W2056944664","https://openalex.org/W1618141553","https://openalex.org/W2138646291","https://openalex.org/W4210771721","https://openalex.org/W2064636475","https://openalex.org/W762829923"],"abstract_inverted_index":{"This":[0],"book":[1],"addresses":[2],"a":[3,8,31,90,99,105,123,147],"theoretical":[4],"problem":[5,50,80,88],"encountered":[6],"in":[7,12,110,189,206,222],"variety":[9],"of":[10,36,41,46,75,98,102,108,126,164,192,209,215,225],"areas":[11],"operations":[13],"research":[14,42],"and":[15,27,33,51,62,152,181,184,195,200,232],"management":[16],"science,":[17],"including":[18],"load":[19],"distribution,":[20],"production":[21],"planning,":[22],"computer":[23],"scheduling,":[24],"portfolio":[25],"selection,":[26],"apportionment.":[28],"It":[29,118],"is":[30,85,187,203,220],"timely":[32],"comprehensive":[34],"summary":[35],"the":[37,47,72,81,96,114,127,190,207,223],"past":[38],"thirty":[39],"years":[40],"on":[43,175],"algorithmic":[44],"aspects":[45],"resource":[48,78],"allocation":[49,79,97],"its":[52],"variants,":[53],"covering":[54],"Lagrangean":[55],"multiplier":[56],"method,":[57],"dynamic":[58],"programming,":[59],"greedy":[60],"algorithms,":[61],"their":[63],"generalizations.":[64],"Modern":[65],"data":[66],"structures":[67],"are":[68],"used":[69],"to":[70,104,112],"analyze":[71],"computational":[73],"complexity":[74],"each":[76],"algorithm.The":[77],"authors":[82],"take":[83],"up":[84],"an":[86],"optimization":[87],"with":[89,138,143],"single":[91],"simple":[92],"constraint:":[93],"it":[94],"determines":[95],"fixed":[100],"amount":[101],"resources":[103],"given":[106],"number":[107],"activities":[109],"order":[111],"achieve":[113],"most":[115],"effective":[116],"results.":[117],"may":[119],"be":[120],"viewed":[121],"as":[122],"special":[124],"case":[125],"nonlinear":[128,131],"programming":[129,133],"or":[130],"integer":[132],"problem.Contents:":[134],"Introduction.":[135],"Resource":[217],"Allocation":[137,142,155,159,168,177,218],"Continuous":[139],"Variables.":[140,145],"Integer":[144],"Minimizing":[146],"Convex":[148],"Separable":[149],"Function.":[150],"Minimax":[151],"Maximin":[153],"Problems.":[156,178],"Fair":[157],"Problem.":[160,162],"Apportionment":[161],"Fundamentals":[163],"Submodular":[165,171],"Systems.":[166],"Problems":[219],"under":[170],"Constraints.":[172],"Further":[173],"Topics":[174],"Appendixes:":[179],"Algorithms":[180],"Complexity.":[182],"NP-completeness":[183],"NP-hardness.Toshihide":[185],"lbaraki":[186],"Professor":[188,205],"Department":[191,208],"Applied":[193],"Mathematics":[194],"Physics":[196],"at":[197,212],"Kyoto":[198],"University":[199,214],"Naoki":[201],"Katoh":[202],"Associate":[204],"Management":[210],"Science":[211],"Kobe":[213],"Commerce.":[216],"included":[221],"Foundations":[224],"Computing":[226],"Series":[227],"edited":[228],"by":[229],"Michael":[230],"Garey":[231],"Albert":[233],"Meyer.":[234]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}