{"id":"https://openalex.org/W2073944685","doi":"https://doi.org/10.1057/palgrave.jors.2601242","title":"Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm","display_name":"Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm","publication_year":2001,"publication_date":"2001-12-01","ids":{"openalex":"https://openalex.org/W2073944685","doi":"https://doi.org/10.1057/palgrave.jors.2601242","mag":"2073944685"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2601242","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601242","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","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/A5032717265","display_name":"G Scheithauer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G Scheithauer","raw_affiliation_strings":["Dresden University of Technology Dresden Germany"],"affiliations":[{"raw_affiliation_string":"Dresden University of Technology Dresden Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021422168","display_name":"Johannes Terno","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J Terno","raw_affiliation_strings":["Dresden University of Technology Dresden Germany"],"affiliations":[{"raw_affiliation_string":"Dresden University of Technology Dresden Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112392532","display_name":"Andreas M\u00fcller","orcid":"https://orcid.org/0000-0002-4468-2651"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A M\u00fcller","raw_affiliation_strings":["Dresden University of Technology Dresden Germany"],"affiliations":[{"raw_affiliation_string":"Dresden University of Technology Dresden Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007487633","display_name":"Gleb Belov","orcid":"https://orcid.org/0000-0002-6120-8484"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G Belov","raw_affiliation_strings":["Dresden University of Technology Dresden Germany"],"affiliations":[{"raw_affiliation_string":"Dresden University of Technology Dresden Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5112392532"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.4749,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.97574853,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"52","issue":"12","first_page":"1390","last_page":"1401"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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.9998000264167786,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9743000268936157,"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.9660000205039978,"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/column-generation","display_name":"Column generation","score":0.8531190156936646},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.8464909791946411},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8163368701934814},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7603862881660461},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.7255966067314148},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6719525456428528},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5815839171409607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5426822304725647},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5155649185180664},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5049744248390198},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.46155500411987305},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4304479956626892},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3832359313964844},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.16494488716125488}],"concepts":[{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.8531190156936646},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.8464909791946411},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8163368701934814},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7603862881660461},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.7255966067314148},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6719525456428528},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5815839171409607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5426822304725647},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5155649185180664},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5049744248390198},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.46155500411987305},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4304479956626892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3832359313964844},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.16494488716125488},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1057/palgrave.jors.2601242","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2601242","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.1538","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.1538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tu-dresden.de/~capad/PAPERS/pr-99-06.ps.gz","raw_type":"text"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:52:y:2001:i:12:d:10.1057_palgrave.jors.2601242","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2601242","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"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/W1484842675","https://openalex.org/W1968143987","https://openalex.org/W1984214681","https://openalex.org/W1992439238","https://openalex.org/W2014510366","https://openalex.org/W2032289187","https://openalex.org/W2032670317","https://openalex.org/W2043923645","https://openalex.org/W2066671865","https://openalex.org/W2096291703","https://openalex.org/W2111565704","https://openalex.org/W2128114926","https://openalex.org/W2144946856","https://openalex.org/W2159827619","https://openalex.org/W2159831195"],"related_works":["https://openalex.org/W3216244780","https://openalex.org/W2073944685","https://openalex.org/W2161798622","https://openalex.org/W2106915499","https://openalex.org/W2588840994","https://openalex.org/W2026751156","https://openalex.org/W2008929768","https://openalex.org/W2107511837","https://openalex.org/W2784393648","https://openalex.org/W2108540209"],"abstract_inverted_index":{"When":[0],"solving":[1],"the":[2,23,33,36,52,85,93,109,119,124],"one-dimensional":[3],"cutting":[4,82,120],"stock":[5,83],"problem":[6,14],"(1D":[7],"CSP)":[8],"as":[9],"an":[10,48,64,104],"integer":[11],"linear":[12],"programming":[13],"one":[15],"has":[16],"to":[17],"overcome":[18],"computational":[19,131],"difficulties":[20],"arising":[21],"from":[22],"integrality":[24],"condition":[25],"and":[26,80,123],"a":[27,116],"huge":[28],"number":[29],"of":[30,51,62,95,118,129],"variables.":[31],"In":[32,99],"Gilmore\u2013Gomory":[34],"approach":[35,107],"corresponding":[37],"continuous":[38],"relaxation":[39],"is":[40,59,72,113],"solved":[41],"via":[42],"column":[43,125],"generation":[44,126],"techniques":[45],"followed":[46],"by":[47],"appropriate":[49],"rounding":[50],"in":[53,67,75,78],"general":[54],"non-integer":[55],"solution.":[56],"Obviously,":[57],"there":[58],"no":[60],"guarantee":[61],"obtaining":[63],"optimal":[65],"solution":[66,106],"this":[68,100],"way":[69],"but":[70],"it":[71],"extremely":[73],"effective":[74,96],"practice.":[76],"However,":[77],"two-":[79],"three-dimensional":[81],"problems":[84],"heuristics":[86],"are":[87,133],"not":[88],"so":[89],"good":[90],"which":[91,112],"necessitates":[92],"research":[94],"exact":[97,105],"methods.":[98],"paper":[101],"we":[102],"present":[103],"for":[108],"1D":[110],"CSP":[111],"based":[114],"on":[115],"combination":[117],"plane":[121],"method":[122],"technique.":[127],"Results":[128],"extensive":[130],"experiments":[132],"reported.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}