{"id":"https://openalex.org/W1746476868","doi":"https://doi.org/10.1023/a:1018346107246","title":"Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem","display_name":"Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem","publication_year":1998,"publication_date":"1998-03-01","ids":{"openalex":"https://openalex.org/W1746476868","doi":"https://doi.org/10.1023/a:1018346107246","mag":"1746476868"},"language":"en","primary_location":{"id":"doi:10.1023/a:1018346107246","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1018346107246","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/A5012322436","display_name":"Pamela H. Vance","orcid":null},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pamela H. Vance","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Auburn University Auburn, Alabama, 36849-5346","Department of Industrial and Systems Engineering Auburn University Auburn, Alabama 36849-5346. E-mail: pvance@eng.auburn.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Auburn University Auburn, Alabama, 36849-5346","institution_ids":["https://openalex.org/I82497590"]},{"raw_affiliation_string":"Department of Industrial and Systems Engineering Auburn University Auburn, Alabama 36849-5346. E-mail: pvance@eng.auburn.edu#TAB#","institution_ids":["https://openalex.org/I82497590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012322436"],"corresponding_institution_ids":["https://openalex.org/I82497590"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":15.1194,"has_fulltext":false,"cited_by_count":154,"citation_normalized_percentile":{"value":0.99222248,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"9","issue":"3","first_page":"211","last_page":"228"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"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.9936000108718872,"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.8648984432220459},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.821288526058197},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.7926845550537109},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7792867422103882},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6695271134376526},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6571240425109863},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6271075010299683},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6014417409896851},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5777633786201477},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.5342131853103638},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4335591495037079},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2755245566368103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10611891746520996},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.06679272651672363}],"concepts":[{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.8648984432220459},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.821288526058197},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.7926845550537109},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7792867422103882},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6695271134376526},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6571240425109863},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6271075010299683},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6014417409896851},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5777633786201477},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.5342131853103638},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4335591495037079},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2755245566368103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10611891746520996},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.06679272651672363},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1023/a:1018346107246","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1018346107246","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/W1489318653","https://openalex.org/W1559705156","https://openalex.org/W1967514691","https://openalex.org/W2003066927","https://openalex.org/W2005926129","https://openalex.org/W2011441830","https://openalex.org/W2013479503","https://openalex.org/W2039212595","https://openalex.org/W2043002484","https://openalex.org/W2045492613","https://openalex.org/W2059961050","https://openalex.org/W2144946856","https://openalex.org/W2167580124"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2171830873","https://openalex.org/W2024753861","https://openalex.org/W1746476868","https://openalex.org/W1605874004","https://openalex.org/W4236278573","https://openalex.org/W2568448495","https://openalex.org/W2802839594","https://openalex.org/W2613933337","https://openalex.org/W2081493497"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":10}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2016-06-24T00:00:00"}