{"id":"https://openalex.org/W2042276676","doi":"https://doi.org/10.1137/s0097539799356265","title":"On Multidimensional Packing Problems","display_name":"On Multidimensional Packing Problems","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2042276676","doi":"https://doi.org/10.1137/s0097539799356265","mag":"2042276676"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539799356265","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799356265","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://repository.upenn.edu/bitstreams/e9e8c5ea-3575-48ad-877d-6d28a3080a68/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I1322087612","display_name":"Alcatel Lucent (Germany)","ror":"https://ror.org/00c5mwp75","country_code":"DE","type":"company","lineage":["https://openalex.org/I1322087612"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["Lucent"],"affiliations":[{"raw_affiliation_string":"Lucent","institution_ids":["https://openalex.org/I1322087612"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["#N#               * University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"#N#               * University of Pennsylvania","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":["https://openalex.org/I1322087612"],"apc_list":null,"apc_paid":null,"fwci":14.3951,"has_fulltext":true,"cited_by_count":212,"citation_normalized_percentile":{"value":0.98937466,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"33","issue":"4","first_page":"837","last_page":"851"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.9336481094360352},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6283784508705139},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.578097939491272},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5667954087257385},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.561838686466217},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5438033938407898},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.5230770707130432},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5039879679679871},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4685707092285156},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4632701873779297},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.44083479046821594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43500688672065735},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4283093214035034},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4272221624851227},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.39719220995903015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2546706199645996},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.21460992097854614},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.13518086075782776}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9336481094360352},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6283784508705139},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.578097939491272},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5667954087257385},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.561838686466217},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5438033938407898},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.5230770707130432},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5039879679679871},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4685707092285156},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4632701873779297},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44083479046821594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43500688672065735},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4283093214035034},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4272221624851227},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.39719220995903015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2546706199645996},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.21460992097854614},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.13518086075782776},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/s0097539799356265","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799356265","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:repository.upenn.edu:20.500.14332/6852","is_oa":false,"landing_page_url":"https://repository.upenn.edu/handle/20.500.14332/6852","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"published","raw_type":"Article"},{"id":"pmh:oai:repository.upenn.edu:cis_papers-1080","is_oa":true,"landing_page_url":"https://repository.upenn.edu/cis_papers/78","pdf_url":"https://repository.upenn.edu/bitstreams/e9e8c5ea-3575-48ad-877d-6d28a3080a68/download","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.41.9038","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.9038","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://inferno.lucent.com/who/chekuri/postscript/vector.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.1094","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.1094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~cisfac/sanjeev/postscript/soda99_packing.ps","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:repository.upenn.edu:cis_papers-1080","is_oa":true,"landing_page_url":"https://repository.upenn.edu/cis_papers/78","pdf_url":"https://repository.upenn.edu/bitstreams/e9e8c5ea-3575-48ad-877d-6d28a3080a68/download","source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Departmental Papers (CIS)","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2042276676.pdf","grobid_xml":"https://content.openalex.org/works/W2042276676.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1593856066","https://openalex.org/W1997020216","https://openalex.org/W2011039300","https://openalex.org/W2022191808","https://openalex.org/W2025787252","https://openalex.org/W2026891055","https://openalex.org/W2049263029","https://openalex.org/W2055037276","https://openalex.org/W2058422149","https://openalex.org/W2084166252","https://openalex.org/W2088961276","https://openalex.org/W2089269509","https://openalex.org/W2093979815","https://openalex.org/W2095697425","https://openalex.org/W2104680817","https://openalex.org/W2111458754","https://openalex.org/W2117812463","https://openalex.org/W2129279570","https://openalex.org/W2133097277","https://openalex.org/W2138254723","https://openalex.org/W2145028977","https://openalex.org/W2154305205","https://openalex.org/W2163322487","https://openalex.org/W2295428206","https://openalex.org/W2576116471","https://openalex.org/W2962924833","https://openalex.org/W3011766368","https://openalex.org/W4231916799","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2078833192","https://openalex.org/W2398075730","https://openalex.org/W2170039532","https://openalex.org/W1442399089","https://openalex.org/W2117588054","https://openalex.org/W2042249499","https://openalex.org/W2087186919","https://openalex.org/W3214452115","https://openalex.org/W79816593","https://openalex.org/W4379032898"],"abstract_inverted_index":{"We":[0,122],"study":[1,22],"the":[2,8,17,23,31,58,75,81,93],"approximability":[3],"of":[4,7,11,39,83,126],"multi-dimensional":[5],"generalizations":[6],"classical":[9],"problems":[10,111],"multiprocessor":[12],"scheduling,":[13,139],"bin":[14,33,71],"packing":[15,34,40,72],"and":[16,36,64,150],"knapsack":[18],"problem.":[19],"Specifically,":[20],"we":[21,140],"vector":[24,32,44,70,138],"scheduling":[25,45,115],"problem,":[26,29,35,73],"its":[27],"dual":[28],"namely,":[30],"a":[37,105,124,142,147],"class":[38],"integer":[41],"programs.":[42],"The":[43,69],"problem":[46],"is":[47,67,102,146],"to":[48,79,86],"schedule":[49,87],"n":[50,89],"d-dimensional":[51],"tasks":[52,90,116],"on":[53,74,96],"m":[54],"machines":[55,66],"such":[56,91],"that":[57,92,117],"maximum":[59,94],"load":[60,95],"over":[61],"all":[62,65,88,100],"dimensions":[63],"minimized.":[68],"other":[76],"hand,":[77],"seeks":[78],"minimize":[80],"number":[82],"bins":[84,101],"needed":[85],"any":[97],"dimension":[98],"across":[99],"bounded":[103],"by":[104],"fixed":[106,148],"quantity,":[107],"say":[108],"1.":[109],"Such":[110],"naturally":[112],"arise":[113],"when":[114,144],"have":[118],"multiple":[119],"resource":[120],"requirements.":[121],"obtain":[123],"variety":[125],"new":[127],"algorithmic":[128],"as":[129,131],"well":[130],"inapproximability":[132],"results":[133],"for":[134],"these":[135],"problems.":[136],"For":[137],"give":[141],"PTAS":[143],"d":[145],"constant,":[149],"an":[151],"O(minflog":[152],"dm;":[153],"log":[154],"2":[155],"dg)-approximation":[156],"in":[157],"gen...":[158]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":13}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}