{"id":"https://openalex.org/W2058596271","doi":"https://doi.org/10.1016/0305-0548(94)90059-0","title":"A branch-and-bound algorithm for the two-dimensional vector packing problem","display_name":"A branch-and-bound algorithm for the two-dimensional vector packing problem","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2058596271","doi":"https://doi.org/10.1016/0305-0548(94)90059-0","mag":"2058596271"},"language":"en","primary_location":{"id":"doi:10.1016/0305-0548(94)90059-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(94)90059-0","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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/A5052356379","display_name":"Frits Spieksma","orcid":"https://orcid.org/0000-0002-2547-3782"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Frits C.R. Spieksma","raw_affiliation_strings":["Department of Mathematics, University of Limburg, P.O. Box 616, 6200 MD, Maastricht, The Netherlands","Maastricht Univ"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Limburg, P.O. Box 616, 6200 MD, Maastricht, The Netherlands","institution_ids":[]},{"raw_affiliation_string":"Maastricht Univ","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052356379"],"corresponding_institution_ids":["https://openalex.org/I34352273"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":4.56,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.93646447,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"21","issue":"1","first_page":"19","last_page":"25"},"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.9968000054359436,"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.9959999918937683,"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.7421700954437256},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6671254634857178},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5450962781906128},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5415276885032654},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5266228318214417},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4991462230682373},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4989509582519531},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.48396849632263184},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4513298273086548},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.442747563123703},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.4379713833332062},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4239409863948822},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39368364214897156},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3626903295516968},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.2668137550354004},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.13671445846557617}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7421700954437256},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6671254634857178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5450962781906128},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5415276885032654},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5266228318214417},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4991462230682373},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4989509582519531},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.48396849632263184},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4513298273086548},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.442747563123703},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.4379713833332062},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4239409863948822},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39368364214897156},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3626903295516968},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.2668137550354004},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.13671445846557617},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0305-0548(94)90059-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(94)90059-0","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W572185210","https://openalex.org/W1519941054","https://openalex.org/W2011039300","https://openalex.org/W2025787252","https://openalex.org/W2043862089","https://openalex.org/W2049595571","https://openalex.org/W2066671865","https://openalex.org/W2079334841","https://openalex.org/W2091519860","https://openalex.org/W2128366796","https://openalex.org/W4239569302","https://openalex.org/W4285719527","https://openalex.org/W6631013238"],"related_works":["https://openalex.org/W2078833192","https://openalex.org/W2398075730","https://openalex.org/W2117588054","https://openalex.org/W2087826159","https://openalex.org/W2935012880","https://openalex.org/W1442399089","https://openalex.org/W2165678151","https://openalex.org/W2598380049","https://openalex.org/W2890423536","https://openalex.org/W2589796617"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}