{"id":"https://openalex.org/W3127764803","doi":"https://doi.org/10.1007/978-3-030-67899-9_1","title":"Online Bin Packing with Overload Cost","display_name":"Online Bin Packing with Overload Cost","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3127764803","doi":"https://doi.org/10.1007/978-3-030-67899-9_1","mag":"3127764803"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-67899-9_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-67899-9_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/5d6660dc-0b3c-413c-b059-a157859a9c09","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077814737","display_name":"Kelin Luo","orcid":"https://orcid.org/0000-0003-2006-0601"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Kelin Luo","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052356379","display_name":"Frits Spieksma","orcid":"https://orcid.org/0000-0002-2547-3782"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Frits C. R. Spieksma","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077814737"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2555,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74217139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3","last_page":"15"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9980000257492065,"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.9204694032669067},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.903694748878479},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5905075669288635},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5396090149879456},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5116401314735413},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5093165636062622},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46247684955596924},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4161382019519806},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4133460223674774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34899216890335083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31222110986709595},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.14382770657539368}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9204694032669067},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.903694748878479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5905075669288635},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5396090149879456},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5116401314735413},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5093165636062622},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46247684955596924},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4161382019519806},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4133460223674774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34899216890335083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31222110986709595},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.14382770657539368},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-67899-9_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-67899-9_1","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire/5d6660dc-0b3c-413c-b059-a157859a9c09","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/5d6660dc-0b3c-413c-b059-a157859a9c09","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Luo, K & Spieksma, F C R 2021, Online Bin Packing with Overload Cost. in A Mudgal & C R Subramanian (eds), Algorithms and Discrete Applied Mathematics : 7th International Conference, CALDAM 2021, Rupnagar, India, February 11\u201313, 2021, Proceedings. Lecture Notes in Computer Science (LNCS), vol. 12601, Springer, Cham, pp. 3-15, 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, Rupnagar, India, 11/02/21. https://doi.org/10.1007/978-3-030-67899-9_1","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/5d6660dc-0b3c-413c-b059-a157859a9c09","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/5d6660dc-0b3c-413c-b059-a157859a9c09","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Luo, K & Spieksma, F C R 2021, Online Bin Packing with Overload Cost. in A Mudgal & C R Subramanian (eds), Algorithms and Discrete Applied Mathematics : 7th International Conference, CALDAM 2021, Rupnagar, India, February 11\u201313, 2021, Proceedings. Lecture Notes in Computer Science (LNCS), vol. 12601, Springer, Cham, pp. 3-15, 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, Rupnagar, India, 11/02/21. https://doi.org/10.1007/978-3-030-67899-9_1","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W14327270","https://openalex.org/W340950190","https://openalex.org/W1588085739","https://openalex.org/W1590563747","https://openalex.org/W1677873712","https://openalex.org/W2001915926","https://openalex.org/W2019755210","https://openalex.org/W2043862089","https://openalex.org/W2054360360","https://openalex.org/W2056716554","https://openalex.org/W2068892231","https://openalex.org/W2080300586","https://openalex.org/W2107065500","https://openalex.org/W2243432867","https://openalex.org/W2247572377","https://openalex.org/W2527257938","https://openalex.org/W2909085189","https://openalex.org/W2963083784","https://openalex.org/W3001995001","https://openalex.org/W3137214896"],"related_works":["https://openalex.org/W2042512761","https://openalex.org/W2107065500","https://openalex.org/W76601469","https://openalex.org/W4235035380","https://openalex.org/W2971368033","https://openalex.org/W2070091108","https://openalex.org/W4288363420","https://openalex.org/W1590563747","https://openalex.org/W3022071589","https://openalex.org/W2026961896"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}