{"id":"https://openalex.org/W2057976086","doi":"https://doi.org/10.1007/s10107-004-0567-y","title":"An asymptotically exact algorithm for the high-multiplicity bin packing problem","display_name":"An asymptotically exact algorithm for the high-multiplicity bin packing problem","publication_year":2005,"publication_date":"2005-02-08","ids":{"openalex":"https://openalex.org/W2057976086","doi":"https://doi.org/10.1007/s10107-004-0567-y","mag":"2057976086"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-004-0567-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0567-y","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5042524970","display_name":"Carlo Filippi","orcid":"https://orcid.org/0000-0002-0685-976X"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Carlo Filippi","raw_affiliation_strings":["Department of Pure and Applied Mathematics, University of Padova, Via Belzoni 7, 35131, Padova, Italy","Department of Pure and Applied Mathematics, University of Padova, via Belzoni 7 - 35131 Padova, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Pure and Applied Mathematics, University of Padova, Via Belzoni 7, 35131, Padova, Italy","institution_ids":["https://openalex.org/I138689650"]},{"raw_affiliation_string":"Department of Pure and Applied Mathematics, University of Padova, via Belzoni 7 - 35131 Padova, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030944098","display_name":"Alessandro Agnetis","orcid":"https://orcid.org/0000-0001-5803-0438"},"institutions":[{"id":"https://openalex.org/I102064193","display_name":"University of Siena","ror":"https://ror.org/01tevnk56","country_code":"IT","type":"education","lineage":["https://openalex.org/I102064193"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alessandro Agnetis","raw_affiliation_strings":["Department of Information Engineering, University of Siena, Via Roma 56, 53100, Siena, Italy","Department of Information Engineering, University of Siena, Via Roma 56, 53100 Siena, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, University of Siena, Via Roma 56, 53100, Siena, Italy","institution_ids":["https://openalex.org/I102064193"]},{"raw_affiliation_string":"Department of Information Engineering, University of Siena, Via Roma 56, 53100 Siena, Italy","institution_ids":["https://openalex.org/I102064193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042524970"],"corresponding_institution_ids":["https://openalex.org/I138689650"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.721,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86246159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"104","issue":"1","first_page":"21","last_page":"37"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.8363622426986694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7982196807861328},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.782227098941803},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5186509490013123},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5123818516731262},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.510188102722168},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.47176769375801086},{"id":"https://openalex.org/keywords/weight-function","display_name":"Weight function","score":0.469748318195343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4548812508583069},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4421735107898712},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4211149215698242},{"id":"https://openalex.org/keywords/solution-set","display_name":"Solution set","score":0.418023943901062},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.37326568365097046},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3656807541847229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09950339794158936},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08004438877105713}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8363622426986694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7982196807861328},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.782227098941803},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5186509490013123},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5123818516731262},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.510188102722168},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.47176769375801086},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.469748318195343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4548812508583069},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4421735107898712},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4211149215698242},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.418023943901062},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.37326568365097046},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3656807541847229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09950339794158936},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08004438877105713},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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":3,"locations":[{"id":"doi:10.1007/s10107-004-0567-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0567-y","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:iris.unibs.it:11379/25858","is_oa":false,"landing_page_url":"http://hdl.handle.net/11379/25858","pdf_url":null,"source":{"id":"https://openalex.org/S4306400804","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Brescia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66752286","host_organization_name":"University of Milano-Bicocca","host_organization_lineage":["https://openalex.org/I66752286"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:usiena-air.unisi.it:11365/17816","is_oa":false,"landing_page_url":"http://hdl.handle.net/11365/17816","pdf_url":null,"source":{"id":"https://openalex.org/S4377196319","display_name":"Use Siena air (University of Siena)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102064193","host_organization_name":"University of Siena","host_organization_lineage":["https://openalex.org/I102064193"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1480142641","https://openalex.org/W1963547452","https://openalex.org/W2003327526","https://openalex.org/W2009505471","https://openalex.org/W2010124065","https://openalex.org/W2032670317","https://openalex.org/W2039212595","https://openalex.org/W2043923645","https://openalex.org/W2051739235","https://openalex.org/W2090960684","https://openalex.org/W2100440346","https://openalex.org/W2107481047","https://openalex.org/W2162870855","https://openalex.org/W2316304469","https://openalex.org/W2596769837"],"related_works":["https://openalex.org/W2547262947","https://openalex.org/W2060747552","https://openalex.org/W2139517419","https://openalex.org/W2987766391","https://openalex.org/W4283393550","https://openalex.org/W2371579306","https://openalex.org/W2385645884","https://openalex.org/W3011699486","https://openalex.org/W1941306591","https://openalex.org/W150528880"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}