{"id":"https://openalex.org/W2044203949","doi":"https://doi.org/10.1057/palgrave.jors.2601554","title":"Unbounded knapsack problem with controllable rates: the case of a random demand for items","display_name":"Unbounded knapsack problem with controllable rates: the case of a random demand for items","publication_year":2003,"publication_date":"2003-06-01","ids":{"openalex":"https://openalex.org/W2044203949","doi":"https://doi.org/10.1057/palgrave.jors.2601554","mag":"2044203949"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2601554","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601554","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","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/A5087562364","display_name":"Konstantin Kogan","orcid":"https://orcid.org/0000-0001-9442-6835"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]},{"id":"https://openalex.org/I157943965","display_name":"Holon Institute of Technology","ror":"https://ror.org/02prqh017","country_code":"IL","type":"education","lineage":["https://openalex.org/I157943965"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"K Kogan","raw_affiliation_strings":["Bar Ilan University and Holon Academic Institute of Technology Holon Israel"],"affiliations":[{"raw_affiliation_string":"Bar Ilan University and Holon Academic Institute of Technology Holon Israel","institution_ids":["https://openalex.org/I157943965","https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087562364"],"corresponding_institution_ids":["https://openalex.org/I13955877","https://openalex.org/I157943965"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.16131872,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"54","issue":"6","first_page":"594","last_page":"604"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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.9993000030517578,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.960917055606842},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7804248332977295},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.6945052146911621},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6893225908279419},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.666205644607544},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.5793104767799377},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5408992171287537},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.5098521113395691},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5050628781318665},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4583835005760193},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4549351632595062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43527013063430786},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4202173352241516},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.17544230818748474},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.15287187695503235},{"id":"https://openalex.org/keywords/microeconomics","display_name":"Microeconomics","score":0.07476705312728882}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.960917055606842},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7804248332977295},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.6945052146911621},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6893225908279419},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.666205644607544},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5793104767799377},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5408992171287537},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.5098521113395691},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5050628781318665},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4583835005760193},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4549351632595062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43527013063430786},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4202173352241516},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.17544230818748474},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.15287187695503235},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.07476705312728882},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/palgrave.jors.2601554","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601554","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:54:y:2003:i:6:d:10.1057_palgrave.jors.2601554","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2601554","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W267034796","https://openalex.org/W1870574493","https://openalex.org/W2066671865","https://openalex.org/W2103736545","https://openalex.org/W2133997119","https://openalex.org/W2171103562","https://openalex.org/W2489790720","https://openalex.org/W4211124581"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W3169691842","https://openalex.org/W2122137596","https://openalex.org/W2381035939","https://openalex.org/W3166857172","https://openalex.org/W2412614002","https://openalex.org/W2024427769","https://openalex.org/W2168163332","https://openalex.org/W4288642040","https://openalex.org/W2087209118"],"abstract_inverted_index":{"This":[0,14],"paper":[1],"focuses":[2],"on":[3],"a":[4,21,27,36,41,63,66,121,127,134],"dynamic,":[5],"continuous-time":[6,115],"control":[7],"generalization":[8,15],"of":[9,43,50,52,55,85,95,123],"the":[10,31,57,72,83,86,109,141],"unbounded":[11,48],"knapsack":[12,22,64],"problem.":[13],"implies":[16],"that":[17,113],"putting":[18],"items":[19,58,78,94],"in":[20,98],"takes":[23],"time":[24],"and":[25,40,103,133],"has":[26],"due":[28],"date.":[29],"Specifically,":[30],"problem":[32,116],"is":[33,79,91,137],"characterized":[34],"by":[35],"limited":[37],"production":[38,68,87],"horizon":[39],"number":[42,49,122],"item":[44],"types.":[45],"Given":[46],"an":[47],"copies":[51],"each":[53,96],"type":[54,97],"item,":[56],"can":[59,117],"be":[60,118],"put":[61],"into":[62],"at":[65],"controllable":[67],"rate":[69],"subject":[70],"to":[71,92,100,108,120,139],"available":[73],"capacity.":[74],"The":[75,89],"demand":[76],"for":[77],"not":[80],"known":[81],"until":[82],"end":[84],"horizon.":[88],"objective":[90],"collect":[93],"order":[99],"minimize":[101],"shortage":[102],"surplus":[104],"costs":[105],"with":[106,144],"respect":[107],"demand.":[110],"We":[111],"prove":[112],"this":[114],"reduced":[119],"discrete-time":[124],"problems.":[125],"As":[126],"result,":[128],"solvable":[129],"cases":[130],"are":[131],"found":[132],"polynomial-time":[135],"algorithm":[136],"suggested":[138],"approximate":[140],"optimal":[142],"solution":[143],"any":[145],"desired":[146],"precision.":[147]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}