{"id":"https://openalex.org/W7225345808","doi":"https://doi.org/10.1007/s00186-026-00947-1","title":"Greedy algorithms with imprecise oracles for submodular knapsack problems","display_name":"Greedy algorithms with imprecise oracles for submodular knapsack problems","publication_year":2026,"publication_date":"2026-11-05","ids":{"openalex":"https://openalex.org/W7225345808","doi":"https://doi.org/10.1007/s00186-026-00947-1"},"language":"en","primary_location":{"id":"doi:10.1007/s00186-026-00947-1","doi":"https://doi.org/10.1007/s00186-026-00947-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00186-026-00947-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00186-026-00947-1.pdf","source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3","vabb-shw"],"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","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Methods of Operations Research","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00186-026-00947-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080260380","display_name":"Sandra M\u00fcnch","orcid":"https://orcid.org/0009-0000-7540-7401","observed_orcids":["https://orcid.org/0009-0000-7540-7401"]},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sabine M\u00fcnch","raw_affiliation_strings":["Trier University, Universit\u00e4tsring 15, 54296, Trier, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Trier University, Universit\u00e4tsring 15, 54296, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035984317","display_name":"Stephen Raach","orcid":"https://orcid.org/0000-0002-9763-2631","observed_orcids":["https://orcid.org/0000-0002-9763-2631"]},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stephen Raach","raw_affiliation_strings":["Trier University, Universit\u00e4tsring 15, 54296, Trier, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Trier University, Universit\u00e4tsring 15, 54296, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080260380"],"corresponding_institution_ids":["https://openalex.org/I89864525"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7749000191688538,"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.7749000191688538,"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/T12176","display_name":"Optimization and Packing Problems","score":0.15209999680519104,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.010900000110268593,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"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/submodular-maximization","display_name":"submodular maximization","score":0.8489999771118164},{"id":"https://openalex.org/keywords/knapsack-constraints","display_name":"knapsack constraints","score":0.9470000267028809},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.781000018119812},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6600000262260437},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.675000011920929}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8712999820709229},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7871999740600586},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7547000050544739},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7294999957084656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6873000264167786},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5649999976158142},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5055000185966492},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5040000081062317},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4657999873161316},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.414900004863739},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.3783999979496002},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.37549999356269836},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36730000376701355},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.35920000076293945},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29159998893737793},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2630999982357025},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.2572000026702881}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00186-026-00947-1","doi":"https://doi.org/10.1007/s00186-026-00947-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00186-026-00947-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00186-026-00947-1.pdf","source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3","vabb-shw"],"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","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Methods of Operations Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00186-026-00947-1","doi":"https://doi.org/10.1007/s00186-026-00947-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00186-026-00947-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00186-026-00947-1.pdf","source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3","vabb-shw"],"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","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Methods of Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320318419","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225345808.pdf","grobid_xml":"https://content.openalex.org/works/W7225345808.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1898824936","https://openalex.org/W1973315504","https://openalex.org/W1985123706","https://openalex.org/W1998735557","https://openalex.org/W2033885045","https://openalex.org/W2053853578","https://openalex.org/W2089047615","https://openalex.org/W2126307323","https://openalex.org/W2143996311","https://openalex.org/W2402962589","https://openalex.org/W2757107770","https://openalex.org/W3048380211","https://openalex.org/W3139359454","https://openalex.org/W4234897719","https://openalex.org/W7124907986"],"related_works":["https://openalex.org/W3139359454","https://openalex.org/W4410077654","https://openalex.org/W4402724326","https://openalex.org/W2252172643","https://openalex.org/W4402625549","https://openalex.org/W7161386851","https://openalex.org/W4389478405","https://openalex.org/W3129707724","https://openalex.org/W3171608239","https://openalex.org/W3042954117"],"abstract_inverted_index":{"Abstract":[0],"We":[1,136],"consider":[2],"the":[3,64,70,75,81,85,92,96,101,104,113,133,138,147,162,192,207,219,223],"problem":[4],"of":[5,18,39,84,91,115,149,161,191,206,222],"maximizing":[6],"a":[7,16,24,174,204],"monotone":[8],"increasing,":[9],"normalized,":[10],"and":[11,54,99,226],"submodular":[12],"function":[13],"defined":[14],"over":[15],"set":[17,53,88],"elements":[19,57],"with":[20,49,58,103,127,181],"associated":[21],"weights":[22],"under":[23],"knapsack":[25,76,97],"constraint.":[26,77],"A":[27],"well-known":[28],"greedy":[29,46,144,163,208,224],"algorithm,":[30,225],"analyzed":[31],"by":[32],"Wolsey":[33],"(1982),":[34],"achieves":[35],"an":[36,50,116,125,151,165,200,212,227],"approximation":[37,140,201],"factor":[38],"$$\\varvec{0.357}$$":[40],"0.357":[41],"for":[42,142,203],"this":[43,109,143],"problem.":[44],"This":[45],"algorithm":[47,110,145,164,209],"starts":[48],"empty":[51],"solution":[52,87],"iteratively":[55],"adds":[56],"maximum":[59,128,193],"relative":[60,129,168,194],"marginal":[61,130,169,195],"gain":[62,131,170],"to":[63,89,132,146],"current":[65,86,134],"solution,":[66],"stopping":[67],"when":[68],"adding":[69],"next":[71],"element":[72,93,126,166],"would":[73],"violate":[74],"Then":[78],"it":[79],"compares":[80],"objective":[82,106],"value":[83],"that":[90,94,120,155],"exceeded":[95],"constraint":[98],"returns":[100],"one":[102],"greater":[105],"value.":[107],"Therefore,":[108],"relies":[111],"on":[112],"existence":[114],"exact":[117,228],"incremental":[118,153,214,229],"oracle":[119,154,215,230],"identifies,":[121],"in":[122,157,210,218,233],"each":[123],"iteration,":[124],"solution.":[135],"generalize":[137],"known":[139],"result":[141,202],"presence":[148],"only":[150],"approximate":[152,213],"identifies":[156],"iteration":[158,221],"$$\\varvec{i}$$":[159],"i":[160,179,187],"whose":[167],"is":[171,216,231],"at":[172],"least":[173],"$$\\varvec{\\frac{1}{\\alpha":[175],"_i}}$$":[176],"1":[177,189],"\u03b1":[178,186],"-fraction,":[180],"$$\\varvec{\\alpha":[182],"_i":[183],"\\ge":[184],"1}$$":[185],"\u2265":[188],",":[190],"gain.":[196],"Furthermore,":[197],"we":[198],"present":[199],"variant":[205],"which":[211],"used":[217,232],"first":[220],"all":[234],"subsequent":[235],"iterations.":[236]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-11-06T00:00:00"}