{"id":"https://openalex.org/W1566816014","doi":"https://doi.org/10.1007/978-3-540-68891-4_31","title":"A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging","display_name":"A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging","publication_year":2008,"publication_date":"2008-05-23","ids":{"openalex":"https://openalex.org/W1566816014","doi":"https://doi.org/10.1007/978-3-540-68891-4_31","mag":"1566816014"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-68891-4_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68891-4_31","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5054050916","display_name":"Yongpei Guan","orcid":"https://orcid.org/0000-0002-6587-7730"},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yongpei Guan","raw_affiliation_strings":["School of Industrial Engineering, University of Oklahoma, USA","School of Industrial Engineering [Oklahoma]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial Engineering, University of Oklahoma, USA","institution_ids":["https://openalex.org/I8692664"]},{"raw_affiliation_string":"School of Industrial Engineering [Oklahoma]","institution_ids":["https://openalex.org/I8692664"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080518736","display_name":"Andrew J. Miller","orcid":"https://orcid.org/0000-0002-0137-4093"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]},{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["AT","FR","US"],"is_corresponding":false,"raw_author_name":"Andrew Miller","raw_affiliation_strings":["Department of Industrial and Systems Engineering, University of Wisconsin, USA","Institut de Math\u00e9matiques de Bordeaux","Reformulations based algorithms for Combinatorial Optimization"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, University of Wisconsin, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Institut de Math\u00e9matiques de Bordeaux","institution_ids":["https://openalex.org/I4210166017"]},{"raw_affiliation_string":"Reformulations based algorithms for Combinatorial Optimization","institution_ids":["https://openalex.org/I4210099593"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"450","last_page":"462"},"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.9994999766349792,"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.9994999766349792,"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.9873999953269958,"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/T11182","display_name":"Auction Theory and Applications","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6969313025474548},{"id":"https://openalex.org/keywords/sizing","display_name":"Sizing","score":0.6606354117393494},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5174553990364075},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5122231841087341},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4888548254966736},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.481243371963501},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4723585546016693},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47163745760917664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46446603536605835},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4159032702445984},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.4144875109195709},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3783969581127167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29533350467681885}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6969313025474548},{"id":"https://openalex.org/C2777767291","wikidata":"https://www.wikidata.org/wiki/Q1080291","display_name":"Sizing","level":2,"score":0.6606354117393494},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5174553990364075},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5122231841087341},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4888548254966736},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.481243371963501},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4723585546016693},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47163745760917664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46446603536605835},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4159032702445984},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.4144875109195709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3783969581127167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29533350467681885},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-540-68891-4_31","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-68891-4_31","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-00387101v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00387101","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"The 13th Conference on Integer Programming and Combinatorial Optimization, May 2008, France. pp.450-462, ⟨10.1007/978-3-540-68891-4_31⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/116119","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/116119","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","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":"IPCO 2008, LNCS 5035","raw_type":"Communication dans un congr\u00e8s avec actes"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/190860","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/190860","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","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":"IPCO 2008, LNCS 5035","raw_type":"Communication dans un congr\u00e8s"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W113308545","https://openalex.org/W1486993561","https://openalex.org/W1696146724","https://openalex.org/W1968143987","https://openalex.org/W1980760279","https://openalex.org/W2000960987","https://openalex.org/W2006135876","https://openalex.org/W2012865252","https://openalex.org/W2026781431","https://openalex.org/W2055427220","https://openalex.org/W2057593340","https://openalex.org/W2059827074","https://openalex.org/W2069633728","https://openalex.org/W2092425721","https://openalex.org/W2101913016","https://openalex.org/W2103622041","https://openalex.org/W2104220231","https://openalex.org/W2109277200","https://openalex.org/W2124420415","https://openalex.org/W2142714854","https://openalex.org/W2147628804","https://openalex.org/W2164189122","https://openalex.org/W2168300772","https://openalex.org/W2170510866","https://openalex.org/W2336259629","https://openalex.org/W2505968561","https://openalex.org/W3106992008","https://openalex.org/W3124517884","https://openalex.org/W3125012073","https://openalex.org/W4237611185","https://openalex.org/W4252999557"],"related_works":["https://openalex.org/W175006096","https://openalex.org/W2086136595","https://openalex.org/W1518635954","https://openalex.org/W3092334672","https://openalex.org/W2599556035","https://openalex.org/W1590308505","https://openalex.org/W2150542653","https://openalex.org/W3116776104","https://openalex.org/W2058868784","https://openalex.org/W2067733412"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-10T00:00:00"}