{"id":"https://openalex.org/W2014857980","doi":"https://doi.org/10.1137/110858082","title":"Generating Moment Matching Scenarios Using Optimization Techniques","display_name":"Generating Moment Matching Scenarios Using Optimization Techniques","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2014857980","doi":"https://doi.org/10.1137/110858082","mag":"2014857980"},"language":"en","primary_location":{"id":"doi:10.1137/110858082","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110858082","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.osti.gov/biblio/1321131","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sanjay Mehrotra","orcid":null},"institutions":[{"id":"https://openalex.org/I4210155590","display_name":"Management Sciences (United States)","ror":"https://ror.org/05shz5j84","country_code":"US","type":"company","lineage":["https://openalex.org/I4210155590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjay Mehrotra","raw_affiliation_strings":["Industrial Engineering and Management Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering and Management Sciences","institution_ids":["https://openalex.org/I4210155590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058400272","display_name":"D\u00e1vid Papp","orcid":"https://orcid.org/0000-0003-4498-6417"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D\u00e1vid Papp","raw_affiliation_strings":["Northwestern University****"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University****","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2988,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.92418488,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"23","issue":"2","first_page":"963","last_page":"999"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/T12404","display_name":"Mathematical Approximation and Integration","score":0.9975000023841858,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9933000206947327,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.688534677028656},{"id":"https://openalex.org/keywords/moment","display_name":"Moment (physics)","score":0.6852879524230957},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6768738031387329},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.587865948677063},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5858871340751648},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.540289580821991},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.5242193937301636},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.4967558979988098},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4767633080482483},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4605511724948883},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4591895639896393},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4369284510612488},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42473727464675903},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.415621817111969},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.355903685092926}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.688534677028656},{"id":"https://openalex.org/C179254644","wikidata":"https://www.wikidata.org/wiki/Q13222844","display_name":"Moment (physics)","level":2,"score":0.6852879524230957},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6768738031387329},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.587865948677063},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5858871340751648},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.540289580821991},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.5242193937301636},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.4967558979988098},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4767633080482483},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4605511724948883},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4591895639896393},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4369284510612488},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42473727464675903},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.415621817111969},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.355903685092926},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/110858082","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110858082","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:osti.gov:1321131","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1321131","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:osti.gov:1321131","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1321131","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W11808602","https://openalex.org/W1553000336","https://openalex.org/W1582056940","https://openalex.org/W1967344706","https://openalex.org/W1988500440","https://openalex.org/W2001033871","https://openalex.org/W2010111476","https://openalex.org/W2011200438","https://openalex.org/W2020902939","https://openalex.org/W2026745750","https://openalex.org/W2033622744","https://openalex.org/W2035532822","https://openalex.org/W2043419861","https://openalex.org/W2051718289","https://openalex.org/W2057638322","https://openalex.org/W2060013459","https://openalex.org/W2100440346","https://openalex.org/W2106828713","https://openalex.org/W2114467398","https://openalex.org/W2130010995","https://openalex.org/W2158958516","https://openalex.org/W2166798101","https://openalex.org/W2492581980","https://openalex.org/W2742900359","https://openalex.org/W4229566358"],"related_works":["https://openalex.org/W2372951866","https://openalex.org/W175006096","https://openalex.org/W4389463731","https://openalex.org/W4293570283","https://openalex.org/W4310823612","https://openalex.org/W10711191","https://openalex.org/W4317569546","https://openalex.org/W2084062606","https://openalex.org/W2947935876","https://openalex.org/W2127388103"],"abstract_inverted_index":{"An":[0],"optimization":[1,122,211,238],"based":[2,89,257],"method":[3,25,87,113,194],"is":[4,26,88,100,114,133,169,178,234],"proposed":[5,193,249],"to":[6,49,77,81,102,130,197,218,230],"generate":[7,31],"moment":[8],"matching":[9,33,45],"scenarios":[10,32,72,76,153],"for":[11,65,171,180],"numerical":[12,184,206],"integration":[13,207],"and":[14,53,73,174,200,209,254],"its":[15,27],"use":[16],"in":[17,68,138,188],"stochastic":[18,210],"programming.":[19],"The":[20,86,116,150,161,213],"main":[21],"advantage":[22],"of":[23,37,39,71,96,152,159,163,165,191,215,223],"the":[24,40,54,69,75,82,97,136,139,166,192,248,260],"flexibility:":[28],"it":[29],"can":[30,56,143],"any":[34,220],"prescribed":[35,221],"set":[36,222],"moments":[38,47,228],"underlying":[41],"distribution":[42,55],"rather":[43,225],"than":[44,226],"all":[46,227],"up":[48,229],"a":[50,66,91,156,231],"certain":[51,232],"order,":[52,233],"be":[57,78,103,128,144],"defined":[58],"over":[59],"an":[60,175],"arbitrary":[61],"set.":[62],"This":[63],"allows":[64,74],"reduction":[67],"number":[70,151],"better":[79],"tailored":[80],"problem":[83,98],"at":[84],"hand.":[85],"on":[90,204,259],"semi-infinite":[92],"linear":[93],"programming":[94],"formulation":[95],"that":[99,135,247],"shown":[101],"solvable":[104],"with":[105,240],"polynomial":[106,121],"iteration":[107],"complexity.":[108],"A":[109],"practical":[110],"column":[111,117,140],"generation":[112,118,141],"implemented.":[115],"subproblems":[119],"are":[120,186,195],"problems;":[123],"however,":[124],"they":[125],"need":[126],"not":[127],"solved":[129],"optimality.":[131],"It":[132],"found":[134],"columns":[137],"approach":[142,250],"efficiently":[145],"generated":[146,154],"by":[147],"random":[148,242],"sampling.":[149],"matches":[155],"lower":[157],"bound":[158,177],"Tchakaloff's.":[160],"rate":[162],"convergence":[164],"approximation":[167],"error":[168],"established":[170],"continuous":[172],"integrands,":[173],"improved":[176],"given":[179],"smooth":[181],"integrands.":[182],"Extensive":[183],"experiments":[185],"presented":[187],"which":[189],"variants":[190],"compared":[196],"Monte":[198,252],"Carlo":[199,202,253,256],"quasi-Monte":[201,255],"methods":[203],"both":[205],"problems":[208,239],"problems.":[212,262],"benefits":[214],"being":[216],"able":[217],"match":[219],"moments,":[224],"also":[235],"demonstrated":[236],"using":[237],"100-dimensional":[241],"vectors.":[243],"Empirical":[244],"results":[245],"show":[246],"outperforms":[251],"approaches":[258],"tested":[261]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}