{"id":"https://openalex.org/W2123179125","doi":"https://doi.org/10.1007/s10107-004-0548-1","title":"The two-dimensional cutting stock problem revisited","display_name":"The two-dimensional cutting stock problem revisited","publication_year":2004,"publication_date":"2004-08-19","ids":{"openalex":"https://openalex.org/W2123179125","doi":"https://doi.org/10.1007/s10107-004-0548-1","mag":"2123179125"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-004-0548-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0548-1","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/A5034376192","display_name":"Steven S. Seiden","orcid":"https://orcid.org/0009-0006-4358-946X"},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven S. Seiden","raw_affiliation_strings":["Department of Computing Science, Lousiana State University, Baton Rouge, LA 70803, USA","Lousiana State University, Department of Computing Science, LA 70803, Baton Rouge, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Lousiana State University, Baton Rouge, LA 70803, USA","institution_ids":["https://openalex.org/I121820613"]},{"raw_affiliation_string":"Lousiana State University, Department of Computing Science, LA 70803, Baton Rouge, USA#TAB#","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"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":"Gerhard J. Woeginger","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, 513, 5600 MB, Eindhoven, The Netherlands","TU Eindhoven, Department of Mathematics and Computer Science, 513, 5600 MB, Eindhoven, The Netherlands#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, Department of Mathematics and Computer Science, 513, 5600 MB, Eindhoven, The Netherlands#TAB#","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080746477"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.8313,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.79618982,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"102","issue":"3","first_page":"519","last_page":"530"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9751999974250793,"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/mathematics","display_name":"Mathematics","score":0.7754248380661011},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7042551040649414},{"id":"https://openalex.org/keywords/asymptotic-expansion","display_name":"Asymptotic expansion","score":0.4980781078338623},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47702619433403015},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4458940327167511},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41743892431259155},{"id":"https://openalex.org/keywords/stock","display_name":"Stock (firearms)","score":0.41098690032958984},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3593575954437256},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.21988049149513245},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.17309823632240295},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06702172756195068}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7754248380661011},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7042551040649414},{"id":"https://openalex.org/C11683690","wikidata":"https://www.wikidata.org/wiki/Q752726","display_name":"Asymptotic expansion","level":2,"score":0.4980781078338623},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47702619433403015},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4458940327167511},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41743892431259155},{"id":"https://openalex.org/C204036174","wikidata":"https://www.wikidata.org/wiki/Q909380","display_name":"Stock (firearms)","level":2,"score":0.41098690032958984},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3593575954437256},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.21988049149513245},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.17309823632240295},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06702172756195068},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10107-004-0548-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-004-0548-1","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:pure.tue.nl:openaire_cris_publications/e63ca693-b679-4757-b087-aa97b7a90344","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/e63ca693-b679-4757-b087-aa97b7a90344","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seiden, S S & Woeginger, G J 2005, 'The two-dimensional cutting stock problem revisited', Mathematical Programming, vol. 102, no. 3, pp. 519-530. https://doi.org/10.1007/s10107-004-0548-1","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:623972","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=623972","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0025-5610","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:623972","is_oa":false,"landing_page_url":"http://repository.tue.nl/623972","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0025-5610","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/e63ca693-b679-4757-b087-aa97b7a90344","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/e63ca693-b679-4757-b087-aa97b7a90344","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming, 102(3), 519 - 530. Springer","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":16,"referenced_works":["https://openalex.org/W1997959089","https://openalex.org/W2010224807","https://openalex.org/W2011039300","https://openalex.org/W2019318803","https://openalex.org/W2031210751","https://openalex.org/W2055717964","https://openalex.org/W2060963575","https://openalex.org/W2071027833","https://openalex.org/W2081987145","https://openalex.org/W2083094973","https://openalex.org/W2110526045","https://openalex.org/W2123068254","https://openalex.org/W2145028977","https://openalex.org/W2153774705","https://openalex.org/W2330422874","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W4386900933","https://openalex.org/W4385301946","https://openalex.org/W1515231571","https://openalex.org/W4297797135","https://openalex.org/W2366084843","https://openalex.org/W2737209624","https://openalex.org/W2089685375","https://openalex.org/W2295542480"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}