{"id":"https://openalex.org/W2200803872","doi":null,"title":"Improved bin completion for optimal bin packing and number partitioning","display_name":"Improved bin completion for optimal bin packing and number partitioning","alternate_titles":[],"publication_year":2013,"publication_date":"2013-08-03","ids":{"openalex":"https://openalex.org/W2200803872","mag":"2200803872"},"language":"en","primary_location":{"id":"mag:2200803872","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/ijcai/ijcai2013.html#SchreiberK13","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2200803872"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5112329027","display_name":"Ethan L. Schreiber","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ethan L. Schreiber","raw_affiliation_strings":["Department of Computer Science, University of California, Los, Angeles, Los Angeles, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Los, Angeles, Los Angeles, CA#TAB#","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012387794","display_name":"Richard E. Korf","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard E. Korf","raw_affiliation_strings":["Department of Computer Science, University of California, Los, Angeles, Los Angeles, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Los, Angeles, Los Angeles, CA#TAB#","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":2.8464,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.88501971,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"651","last_page":"658"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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","score":0.8360000252723694},{"id":"https://openalex.org/keywords/number-partitioning","display_name":"number partitioning","score":0.9440000057220459},{"id":"https://openalex.org/keywords/branch-and-price-and-cut","display_name":"branch-price-and-cut","score":0.984000027179718},{"id":"https://openalex.org/keywords/differential-image-motion-monitor","display_name":"differential image motion monitor","score":0.6359999775886536},{"id":"https://openalex.org/keywords/combinatorial-optimization-algorithms","display_name":"combinatorial optimization algorithms","score":0.7630000114440918},{"id":"https://openalex.org/keywords/algorithm-acceleration","display_name":"algorithm acceleration","score":0.5879999995231628},{"id":"https://openalex.org/keywords/benchmark-instance-generation","display_name":"benchmark instance generation","score":0.5830000042915344}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9128220677375793},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.8229629993438721},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6253116130828857},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5726754069328308},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5261589884757996},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4807272255420685},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.4654702842235565},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.45207783579826355},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.45048806071281433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4364085793495178},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39487141370773315},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36359813809394836},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.29003775119781494}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2200803872","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/ijcai/ijcai2013.html#SchreiberK13","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.374.8125","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.8125","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ijcai.org/papers13/Papers/IJCAI13-103.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W90587812","https://openalex.org/W91781137","https://openalex.org/W1543921836","https://openalex.org/W1570631094","https://openalex.org/W1595545560","https://openalex.org/W1909318870","https://openalex.org/W1992439238","https://openalex.org/W2009683816","https://openalex.org/W2011039300","https://openalex.org/W2013067314","https://openalex.org/W2019133545","https://openalex.org/W2049418901","https://openalex.org/W2052841853","https://openalex.org/W2059582160","https://openalex.org/W2066671865","https://openalex.org/W2087245794","https://openalex.org/W2089269509","https://openalex.org/W2093188170","https://openalex.org/W2096053066","https://openalex.org/W2125554210","https://openalex.org/W2144946856","https://openalex.org/W2204911212","https://openalex.org/W2396275016","https://openalex.org/W2399594521"],"related_works":["https://openalex.org/W90587812","https://openalex.org/W2096053066","https://openalex.org/W2318421611","https://openalex.org/W1596439539","https://openalex.org/W2139936806","https://openalex.org/W7097649664","https://openalex.org/W2090865599","https://openalex.org/W1569849143","https://openalex.org/W1992365301","https://openalex.org/W4388628635"],"abstract_inverted_index":{"The":[0],"bin-packing":[1,114],"problem":[2,54],"is":[3,108,111,121,160],"to":[4,83,92,99,123,162,176,186,190],"partition":[5],"a":[6,60,88,130,143,169],"multiset":[7],"of":[8,15,24,62,66,73,90,95,126,165,179],"n":[9],"numbers":[10,26],"into":[11],"as":[12,18,97],"few":[13,138],"bins":[14,74],"capacity":[16],"C":[17],"possible,":[19],"such":[20],"that":[21,52,109,118,152],"the":[22,25,53,64,67,71,100,105,112,147,180],"sum":[23],"in":[27,75,87],"each":[28],"bin":[29,43,158],"does":[30],"not":[31],"exceed":[32],"C.":[33],"We":[34,49,79,140],"compare":[35],"two":[36],"existing":[37],"algorithms":[38],"for":[39],"solving":[40],"this":[41],"problem:":[42],"completion":[44],"(BC)":[45],"and":[46,56,70,150],"branch-and-cut-and-price":[47],"(BCP).":[48],"show":[50,117,151,184],"experimentally":[51],"difficulty":[55],"dominant":[57,113],"algorithm":[58,133,154],"are":[59],"function":[61],"n,":[63],"precision":[65],"input":[68],"elements":[69],"number":[72,188],"an":[76,153],"optimal":[77],"solution.":[78],"describe":[80],"three":[81,163],"improvements":[82],"BC":[84,102,120],"which":[85,174],"result":[86],"speedup":[89],"up":[91,122,161],"five":[93,124],"orders":[94,125,164],"magnitude":[96,127,166],"compared":[98],"original":[101],"algorithm.":[103],"While":[104],"current":[106],"belief":[107],"BCP":[110,132,170],"algorithm,":[115],"we":[116,183],"improved":[119,157],"faster":[128,167],"than":[129,168],"state-of-the-art":[131],"on":[134,156],"problems":[135],"with":[136],"relatively":[137],"bins.":[139],"then":[141],"explore":[142],"closely":[144],"related":[145],"problem,":[146,149],"number-partitioning":[148],"based":[155],"packing":[159],"solver":[171],"called":[172],"DIMM":[173],"claims":[175],"be":[177],"state":[178],"art.":[181],"Finally,":[182],"how":[185],"use":[187],"partitioning":[189],"generate":[191],"difficult":[192],"binpacking":[193],"instances.":[194]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2200803872","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
