{"id":"https://openalex.org/W7170185458","doi":"https://doi.org/10.48550/arxiv.2607.19557","title":"Packing Linear Programs and Fractional Knapsack using Comparison Oracles","display_name":"Packing Linear Programs and Fractional Knapsack using Comparison Oracles","publication_year":2026,"publication_date":"2026-07-21","ids":{"openalex":"https://openalex.org/W7170185458","doi":"https://doi.org/10.48550/arxiv.2607.19557"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.19557","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.19557","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.19557","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5143496335","display_name":"Ritabrata Barat","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Barat, Ritabrata","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039018238","display_name":"Siddharth Barman","orcid":"https://orcid.org/0000-0001-9276-2181"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Barman, Siddharth","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143504122","display_name":"Nirjhar Das","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Das, Nirjhar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5143515673","display_name":"Sukruta Midigeshi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Midigeshi, Sukruta","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"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":0,"citation_normalized_percentile":null,"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/T12176","display_name":"Optimization and Packing Problems","score":0.29820001125335693,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.29820001125335693,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2451999932527542,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.09200000017881393,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9430000185966492},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5040000081062317},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5027999877929688},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4977000057697296},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.48649999499320984},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.46810001134872437},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.44909998774528503},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.37630000710487366},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.3659000098705292}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9430000185966492},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6647999882698059},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5040000081062317},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5027999877929688},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4977000057697296},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.48649999499320984},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.46810001134872437},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4616999924182892},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.44909998774528503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38179999589920044},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.37630000710487366},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3659000098705292},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3508000075817108},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.3328000009059906},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.32690000534057617},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.32249999046325684},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3147999942302704},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.31279999017715454},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.30570000410079956},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.296099990606308},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.28630000352859497},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.27799999713897705},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.267300009727478},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2669000029563904},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25760000944137573}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.19557","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.19557","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.19557","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.19557","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,60,178],"study":[1],"the":[2,6,14,63,68,83,121,162,168,174,193,207,217,222,259],"problem":[3],"of":[4,8,54,133,164,258,262],"recovering":[5,148],"objective":[7,84,126],"a":[9,74,94,97,145,212,244,255],"packing":[10,69,124,202,208,233],"linear":[11,70],"program":[12,71],"when":[13],"algorithm":[15,108,147,205,251],"accesses":[16],"only":[17],"comparison":[18,31,105,157],"information":[19],"about":[20],"optimal":[21,55,118],"solutions":[22,56],"under":[23],"varying":[24],"constraint":[25,77,213],"matrices.":[26],"Motivated":[27],"by":[28,50,79,87,210],"optimization":[29],"with":[30,57,112,181],"oracles":[32,129],"(Cohen-Addad":[33],"et":[34,42,264],"al.,":[35,43],"STOC":[36],"2026)":[37],"and":[38,82,171,220],"preference":[39],"feedback":[40],"(Kaufmann":[41],"TMLR":[44],"2025),":[45],"this":[46,180],"strengthens":[47],"inverse-optimization":[48],"frameworks":[49],"replacing":[51],"direct":[52],"observations":[53],"ordinal":[58],"queries.":[59],"focus":[61],"on":[62],"fractional":[64,141,196],"knapsack":[65,169,197],"problem,":[66],"where":[67,93,159],"(LP)":[72],"has":[73,120],"single":[75],"budget":[76],"specified":[78],"item":[80,88,149],"prices,":[81],"is":[85,161,167,173,190,198],"determined":[86],"values.":[89],"This":[90],"captures":[91],"monopoly-pricing":[92],"seller":[95],"infers":[96],"buyer's":[98],"unknown":[99],"valuations":[100],"for":[101,232],"divisible":[102],"items":[103],"from":[104],"information.":[106],"The":[107,224],"queries":[109],"an":[110,182],"oracle":[111],"two":[113],"price":[114,218],"vectors,":[115],"returning":[116],"which":[117],"solution":[119],"larger":[122],"total":[123],"or":[125],"value.":[127],"Such":[128],"abstract":[130],"discrete-choice":[131],"surveys":[132],"buyers":[134],"choosing":[135],"between":[136],"differently":[137],"priced":[138],"alternatives.":[139],"For":[140],"knapsack,":[142],"we":[143,248],"develop":[144],"polynomial-time":[146],"values":[150],"up":[151,242],"to":[152,230,243,252],"scale":[153],"using":[154],"$O(n":[155],"\\log(1/\u03b4)+B^2)$":[156],"queries,":[158],"$n$":[160],"number":[163],"items,":[165],"$B$":[166],"capacity,":[170],"$\u03b4$":[172],"value":[175],"grid":[176],"resolution.":[177],"complement":[179],"$\u03a9(n":[183,225],"\\log(1/\u03b4))$":[184,226],"lower":[185,227],"bound.":[186],"A":[187],"key":[188],"insight":[189],"that":[191],"in":[192],"comparison-oracle":[194,256],"model,":[195],"as":[199,201,216],"general":[200],"LPs.":[203],"Our":[204],"solves":[206],"setting":[209],"treating":[211],"matrix":[214],"row":[215],"vector":[219],"zeroing":[221],"rest.":[223],"bound":[228,238],"continues":[229],"hold":[231],"LPs,":[234],"making":[235],"our":[236,250],"upper":[237],"essentially":[239],"best":[240],"possible,":[241],"linear-factor":[245],"gap.":[246],"Finally,":[247],"extend":[249],"profit-maximization,":[253],"yielding":[254],"analogue":[257],"revealed-preference":[260],"result":[261],"Amin":[263],"al.":[265],"(AAAI":[266],"2015).":[267]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-24T00:00:00"}