{"id":"https://openalex.org/W2754581688","doi":"https://doi.org/10.1007/s10107-017-1190-z","title":"On quantile cuts and their closure for chance constrained optimization problems","display_name":"On quantile cuts and their closure for chance constrained optimization problems","publication_year":2017,"publication_date":"2017-09-09","ids":{"openalex":"https://openalex.org/W2754581688","doi":"https://doi.org/10.1007/s10107-017-1190-z","mag":"2754581688"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-017-1190-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-017-1190-z","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/A5048142877","display_name":"Weijun Xie","orcid":"https://orcid.org/0000-0001-5157-1194"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weijun Xie","raw_affiliation_strings":["Virginia Tech, Blacksburg, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027399293","display_name":"Shabbir Ahmed","orcid":"https://orcid.org/0000-0001-7049-7305"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shabbir Ahmed","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027399293"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":null,"fwci":1.1104,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.78211335,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"172","issue":"1-2","first_page":"621","last_page":"646"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9969000220298767,"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"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9969000220298767,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9909999966621399,"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/mathematics","display_name":"Mathematics","score":0.8163610696792603},{"id":"https://openalex.org/keywords/quantile","display_name":"Quantile","score":0.6861437559127808},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.647071361541748},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5144403576850891},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5000030994415283},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.4885021448135376},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.46080613136291504},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4551447033882141},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4318883419036865},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4253161549568176},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.42119723558425903},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41765904426574707},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41732436418533325},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4140230715274811},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4101281464099884},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4071016013622284},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3959643840789795},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3038060665130615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2237023413181305}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8163610696792603},{"id":"https://openalex.org/C118671147","wikidata":"https://www.wikidata.org/wiki/Q578714","display_name":"Quantile","level":2,"score":0.6861437559127808},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.647071361541748},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5144403576850891},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5000030994415283},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.4885021448135376},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.46080613136291504},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4551447033882141},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4318883419036865},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4253161549568176},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.42119723558425903},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41765904426574707},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41732436418533325},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4140230715274811},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4101281464099884},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4071016013622284},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3959643840789795},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3038060665130615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2237023413181305},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-017-1190-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-017-1190-z","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":[{"id":"https://openalex.org/G3107769798","display_name":null,"funder_award_id":"1331426","funder_id":"https://openalex.org/F4320332170","funder_display_name":"Directorate for Engineering"},{"id":"https://openalex.org/G6896284404","display_name":null,"funder_award_id":"1633196","funder_id":"https://openalex.org/F4320332170","funder_display_name":"Directorate for Engineering"},{"id":"https://openalex.org/G8899912897","display_name":null,"funder_award_id":"N00014-15-1-2078","funder_id":"https://openalex.org/F4320338298","funder_display_name":"Office of Naval Research Global"}],"funders":[{"id":"https://openalex.org/F4320332170","display_name":"Directorate for Engineering","ror":"https://ror.org/00b6sbb32"},{"id":"https://openalex.org/F4320338298","display_name":"Office of Naval Research Global","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1538052089","https://openalex.org/W1571966798","https://openalex.org/W1644797908","https://openalex.org/W1840577010","https://openalex.org/W1965970856","https://openalex.org/W1989755892","https://openalex.org/W2002307851","https://openalex.org/W2018714454","https://openalex.org/W2035117007","https://openalex.org/W2041977479","https://openalex.org/W2082154838","https://openalex.org/W2093022060","https://openalex.org/W2139869783","https://openalex.org/W2147288643","https://openalex.org/W2151140685","https://openalex.org/W2155692489","https://openalex.org/W2405594452","https://openalex.org/W2565581500","https://openalex.org/W4239098620"],"related_works":["https://openalex.org/W2072121858","https://openalex.org/W2009869936","https://openalex.org/W1982719520","https://openalex.org/W1983278797","https://openalex.org/W1509031531","https://openalex.org/W2390699817","https://openalex.org/W2983072348","https://openalex.org/W2163159773","https://openalex.org/W2023242492","https://openalex.org/W1437939261"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}