{"id":"https://openalex.org/W1664252374","doi":"https://doi.org/10.1007/s10107-003-0465-8","title":"A study of the lot-sizing polytope","display_name":"A study of the lot-sizing polytope","publication_year":2004,"publication_date":"2004-03-20","ids":{"openalex":"https://openalex.org/W1664252374","doi":"https://doi.org/10.1007/s10107-003-0465-8","mag":"1664252374"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-003-0465-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0465-8","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/A5096888819","display_name":"Alper Atamt\ufffdrk","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alper Atamt\ufffdrk","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California, 4135 Etcheverry Hall, Berkeley CA, 94720\u20131777, USA","University of California, Department of Industrial Engineering and Operations Research, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California, 4135 Etcheverry Hall, Berkeley CA, 94720\u20131777, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, Department of Industrial Engineering and Operations Research, USA#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110106151","display_name":"Juan Carlos Mu\ufffdoz","orcid":null},"institutions":[{"id":"https://openalex.org/I162148367","display_name":"Pontificia Universidad Cat\u00f3lica de Chile","ror":"https://ror.org/04teye511","country_code":"CL","type":"education","lineage":["https://openalex.org/I162148367"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Juan Carlos Mu\ufffdoz","raw_affiliation_strings":["Department of Civil and Environmental Engineering, University of California, 416G McLaughlin Hall, Berkeley, CA, 94720\u20131720, USA Currently in Pontificia Universidad Cat\u00f3lica de Chile","University of California, Department of Civil and Environmental Engineering, USA Currently in Pontificia Universidad Cat\u00f3lica de Chile.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Civil and Environmental Engineering, University of California, 416G McLaughlin Hall, Berkeley, CA, 94720\u20131720, USA Currently in Pontificia Universidad Cat\u00f3lica de Chile","institution_ids":["https://openalex.org/I162148367"]},{"raw_affiliation_string":"University of California, Department of Civil and Environmental Engineering, USA Currently in Pontificia Universidad Cat\u00f3lica de Chile.#TAB#","institution_ids":["https://openalex.org/I162148367"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":5.7897,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.95563392,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"99","issue":"3","first_page":"443","last_page":"465"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9904000163078308,"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.9896000027656555,"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/polytope","display_name":"Polytope","score":0.9011630415916443},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7440627217292786},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.725471019744873},{"id":"https://openalex.org/keywords/sizing","display_name":"Sizing","score":0.6770143508911133},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.585593044757843},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5801804065704346},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5733026266098022},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5349256992340088},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5209399461746216},{"id":"https://openalex.org/keywords/facet","display_name":"Facet (psychology)","score":0.5209125876426697},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5201849937438965},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.503433883190155},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.48283132910728455},{"id":"https://openalex.org/keywords/polyhedral-combinatorics","display_name":"Polyhedral combinatorics","score":0.46728000044822693},{"id":"https://openalex.org/keywords/extreme-point","display_name":"Extreme point","score":0.46360906958580017},{"id":"https://openalex.org/keywords/polytope-model","display_name":"Polytope model","score":0.4420674443244934},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.4380512237548828},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3869376480579376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20045217871665955},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09466323256492615}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.9011630415916443},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7440627217292786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.725471019744873},{"id":"https://openalex.org/C2777767291","wikidata":"https://www.wikidata.org/wiki/Q1080291","display_name":"Sizing","level":2,"score":0.6770143508911133},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.585593044757843},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5801804065704346},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5733026266098022},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5349256992340088},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5209399461746216},{"id":"https://openalex.org/C43122875","wikidata":"https://www.wikidata.org/wiki/Q5428522","display_name":"Facet (psychology)","level":4,"score":0.5209125876426697},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5201849937438965},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.503433883190155},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.48283132910728455},{"id":"https://openalex.org/C174248988","wikidata":"https://www.wikidata.org/wiki/Q8348314","display_name":"Polyhedral combinatorics","level":5,"score":0.46728000044822693},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.46360906958580017},{"id":"https://openalex.org/C113391598","wikidata":"https://www.wikidata.org/wiki/Q1681391","display_name":"Polytope model","level":3,"score":0.4420674443244934},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4380512237548828},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3869376480579376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20045217871665955},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09466323256492615},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C187288502","wikidata":"https://www.wikidata.org/wiki/Q641118","display_name":"Personality","level":2,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C2865642","wikidata":"https://www.wikidata.org/wiki/Q378132","display_name":"Big Five personality traits","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-003-0465-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0465-8","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W162078474","https://openalex.org/W1481126596","https://openalex.org/W1977545325","https://openalex.org/W2000960987","https://openalex.org/W2002244312","https://openalex.org/W2044758517","https://openalex.org/W2046269316","https://openalex.org/W2050047854","https://openalex.org/W2053930851","https://openalex.org/W2057593340","https://openalex.org/W2061538120","https://openalex.org/W2063682953","https://openalex.org/W2078140282","https://openalex.org/W2106495447","https://openalex.org/W2107396523","https://openalex.org/W2107474910","https://openalex.org/W2107857629","https://openalex.org/W2113912706","https://openalex.org/W2120803616","https://openalex.org/W2124420415","https://openalex.org/W2142714854","https://openalex.org/W2147628804","https://openalex.org/W2162219800","https://openalex.org/W2168300772"],"related_works":["https://openalex.org/W1531708257","https://openalex.org/W2109445739","https://openalex.org/W2110818895","https://openalex.org/W134055995","https://openalex.org/W566167518","https://openalex.org/W2021079478","https://openalex.org/W4210880521","https://openalex.org/W2105006450","https://openalex.org/W3126345618","https://openalex.org/W2979455991"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}