{"id":"https://openalex.org/W2179705271","doi":"https://doi.org/10.1080/10556788.2015.1088850","title":"Efficient constraint reduction in multistage stochastic programming problems with endogenous uncertainty","display_name":"Efficient constraint reduction in multistage stochastic programming problems with endogenous uncertainty","publication_year":2015,"publication_date":"2015-11-13","ids":{"openalex":"https://openalex.org/W2179705271","doi":"https://doi.org/10.1080/10556788.2015.1088850","mag":"2179705271"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2015.1088850","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1088850","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5028083590","display_name":"F. Hooshmand","orcid":"https://orcid.org/0000-0002-2449-3925"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"F. Hooshmand","raw_affiliation_strings":["Department of Applied Mathematics, Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047692637","display_name":"S.\u200bA. MirHassani","orcid":"https://orcid.org/0000-0002-9894-7053"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"S.A. MirHassani","raw_affiliation_strings":["Department of Applied Mathematics, Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Faculty of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047692637"],"corresponding_institution_ids":["https://openalex.org/I158248296"],"apc_list":null,"apc_paid":null,"fwci":1.6024,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.85713465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"31","issue":"2","first_page":"359","last_page":"376"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T11976","display_name":"Capital Investment and Risk Analysis","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2003","display_name":"Finance"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/reduction","display_name":"Reduction (mathematics)","score":0.7530935406684875},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6554555296897888},{"id":"https://openalex.org/keywords/cartesian-product","display_name":"Cartesian product","score":0.5831066966056824},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5725208520889282},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5701901912689209},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.551970899105072},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5112700462341309},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4902527630329132},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.47683921456336975},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.4728413224220276},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3442051112651825},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11398953199386597},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08667707443237305}],"concepts":[{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.7530935406684875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6554555296897888},{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.5831066966056824},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5725208520889282},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5701901912689209},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.551970899105072},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5112700462341309},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4902527630329132},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.47683921456336975},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.4728413224220276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3442051112651825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11398953199386597},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08667707443237305},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","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.1080/10556788.2015.1088850","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1088850","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1569990960","https://openalex.org/W1969735923","https://openalex.org/W1977545325","https://openalex.org/W1989263908","https://openalex.org/W1992353457","https://openalex.org/W2010659249","https://openalex.org/W2057383708","https://openalex.org/W2060768440","https://openalex.org/W2062921651","https://openalex.org/W2067867177","https://openalex.org/W2085449023","https://openalex.org/W2102207514","https://openalex.org/W2163969905","https://openalex.org/W2164651650","https://openalex.org/W2338861484","https://openalex.org/W2549514423","https://openalex.org/W4213060235"],"related_works":["https://openalex.org/W2381242807","https://openalex.org/W2751208925","https://openalex.org/W2347541121","https://openalex.org/W4288804799","https://openalex.org/W3089617106","https://openalex.org/W1523365952","https://openalex.org/W2147600044","https://openalex.org/W2014328192","https://openalex.org/W1548246675","https://openalex.org/W1752785500"],"abstract_inverted_index":{"Multistage":[0],"stochastic":[1],"programming":[2,135],"with":[3,31],"endogenous":[4,91],"uncertainty":[5,15],"is":[6,17,80,95,113,131,141,154,166],"a":[7,42,55,96],"new":[8],"topic":[9],"in":[10,58,68,72,99,161],"which":[11],"the":[12,22,32,37,59,69,73,77,83,106,110,138,148,151,158,162,175,178],"timing":[13],"of":[14,24,34,45,86,164,169,177],"realization":[16],"decision-dependent.":[18],"In":[19,101],"this":[20,94,102,170],"case,":[21],"number":[23,33,44,163],"nonanticipativity":[25],"constraints":[26],"(NACs)":[27],"increases":[28],"very":[29],"quickly":[30],"scenarios,":[35],"making":[36],"problem":[38,60],"computationally":[39],"intractable.":[40],"Fortunately,":[41],"large":[43],"NACs":[46,64,165],"are":[47,126],"typically":[48],"redundant":[49,63,124],"and":[50,117,137],"their":[51],"elimination":[52],"leads":[53],"to":[54,82,121,156],"considerable":[56],"reduction":[57,160],"size.":[61],"Identifying":[62],"has":[65],"been":[66],"addressed":[67],"literature":[70],"only":[71],"special":[74],"case":[75,108],"where":[76,109],"scenario":[78,111],"set":[79,112],"equal":[81],"Cartesian":[84],"product":[85],"all":[87,123],"possible":[88],"outcomes":[89],"for":[90],"parameters;":[92],"however,":[93],"scarce":[97],"condition":[98],"practice.":[100],"paper,":[103],"we":[104],"consider":[105],"general":[107],"an":[114,142],"arbitrary":[115],"set;":[116],"two":[118],"approaches,":[119],"able":[120,155],"identify":[122],"NACs,":[125],"proposed.":[127],"The":[128],"first":[129],"approach":[130],"by":[132],"mixed":[133],"integer":[134],"formulation":[136],"second":[139],"one":[140],"exact":[143],"polynomial":[144],"time":[145],"algorithm.":[146],"Proving":[147],"fact":[149],"that":[150],"proposed":[152,179],"algorithm":[153],"make":[157],"uppermost":[159],"another":[167],"novelty":[168],"paper.":[171],"Computational":[172],"results":[173],"evaluate":[174],"efficiency":[176],"approaches.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}