{"id":"https://openalex.org/W1987387619","doi":"https://doi.org/10.1137/060670328","title":"An APTAS for Generalized Cost Variable-Sized Bin Packing","display_name":"An APTAS for Generalized Cost Variable-Sized Bin Packing","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1987387619","doi":"https://doi.org/10.1137/060670328","mag":"1987387619"},"language":"en","primary_location":{"id":"doi:10.1137/060670328","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060670328","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023269343","display_name":"Leah Epstein","orcid":"https://orcid.org/0000-0002-6761-8521"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leah Epstein","raw_affiliation_strings":["lea@math.haifa.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"lea@math.haifa.ac.il#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064961974","display_name":"Asaf Levin","orcid":"https://orcid.org/0000-0001-7935-6218"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Asaf Levin","raw_affiliation_strings":["levinas@mscc.huji.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"levinas@mscc.huji.ac.il#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.9604,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.9568371,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"38","issue":"1","first_page":"411","last_page":"428"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":1.0,"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":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9975000023841858,"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.996999979019165,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.8468672037124634},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.7965623140335083},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7642947435379028},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5966863036155701},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4906558096408844},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45024725794792175},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4350701570510864},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41304171085357666},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30576616525650024},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2642548680305481},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1945188343524933}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8468672037124634},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.7965623140335083},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7642947435379028},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5966863036155701},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4906558096408844},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45024725794792175},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4350701570510864},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41304171085357666},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30576616525650024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2642548680305481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1945188343524933},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/060670328","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060670328","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:CiteSeerX.psu:10.1.1.108.1348","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.1348","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://math.haifa.ac.il/lea/aptas_vs.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1543921836","https://openalex.org/W1595545560","https://openalex.org/W1964501931","https://openalex.org/W2006671706","https://openalex.org/W2011949460","https://openalex.org/W2014071862","https://openalex.org/W2032522336","https://openalex.org/W2056716554","https://openalex.org/W2058200712","https://openalex.org/W2068892231","https://openalex.org/W2080300586","https://openalex.org/W2114616381","https://openalex.org/W2123068254","https://openalex.org/W2145028977"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W173368591","https://openalex.org/W2034272113","https://openalex.org/W2138242427","https://openalex.org/W4288260564","https://openalex.org/W4255148175","https://openalex.org/W2971368033","https://openalex.org/W2001915926","https://openalex.org/W2096053066"],"abstract_inverted_index":{"Bin":[0],"packing":[1,15,29],"is":[2,16,55,77,126],"a":[3,8,17,37,40,53,80],"well-known":[4],"problem":[5,30,71,102],"which":[6,21,83],"has":[7,103],"large":[9],"number":[10],"of":[11,39,42,52,94],"applications.":[12],"Classical":[13],"bin":[14,28,54,75,96],"simple":[18],"model":[19,46],"in":[20,106],"all":[22],"bins":[23],"are":[24,35,98],"identical.":[25],"In":[26,63,110],"the":[27,50,68,134],"with":[31,79],"variable-sized":[32],"bins,":[33],"we":[34,66,116],"given":[36],"supply":[38],"variety":[41],"sizes.":[43],"This":[44,100],"latter":[45],"assumes,":[47],"however,":[48],"that":[49],"cost":[51],"always":[56],"defined":[57],"to":[58,112],"be":[59,85],"its":[60,90],"exact":[61],"size.":[62,91],"this":[64],"paper":[65],"study":[67],"more":[69],"general":[70],"where":[72],"an":[73,127],"available":[74],"size":[76],"associated":[78],"fixed":[81],"cost,":[82],"may":[84],"smaller":[86],"or":[87],"larger":[88],"than":[89],"The":[92],"costs":[93],"different":[95],"sizes":[97],"unrelated.":[99],"generalized":[101,135],"various":[104],"applications":[105],"storage":[107],"and":[108,120],"scheduling.":[109],"order":[111],"generalize":[113],"previous":[114],"work,":[115],"design":[117],"new":[118],"rounding":[119],"allocation":[121],"methods.":[122],"Our":[123],"main":[124],"result":[125],"asymptotic":[128],"polynomial":[129],"time":[130],"approximation":[131],"scheme":[132],"for":[133],"problem.":[136]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}