default search action
Wolfram Wiesemann
Person information
- affiliation: Imperial College London, Imperial College Business School, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j45]Kilian Schindler, Napat Rujeerapaiboon
, Daniel Kuhn
A Planner-Trader Decomposition for Multimarket Hydro Scheduling. Oper. Res. 72(1): 185-202 (2024) - [j44]Zhi Chen
Technical Note - Data-Driven Chance Constrained Programs over Wasserstein Balls. Oper. Res. 72(1): 410-424 (2024) - [j43]Shubhechyya Ghosal, Chin Pang Ho
A Unifying Framework for the Capacitated Vehicle Routing Problem Under Risk and Ambiguity. Oper. Res. 72(2): 425-443 (2024) - [j42]Zhengchao Wang
Randomized Assortment Optimization. Oper. Res. 72(5): 2042-2060 (2024) - 2023
- [j41]Josh C. D'aeth
Optimal Hospital Care Scheduling During the SARS-CoV-2 Pandemic. Manag. Sci. 69(10): 5923-5947 (2023) - [j40]Aras Selvi
A reformulation-linearization technique for optimization over simplices. Math. Program. 197(1): 427-447 (2023) - [j39]Zhi Chen
On approximations of data-driven chance constrained programs over Wasserstein balls. Oper. Res. Lett. 51(3): 226-233 (2023) - [i8]Aras Selvi, Huikang Liu, Wolfram Wiesemann:
Differential Privacy via Distributionally Robust Optimization. CoRR abs/2304.12681 (2023) - [i7]Florian Joseph Baader, Stefano Moret, Wolfram Wiesemann, Iain Staffell, André Bardow:
Streamlining Energy Transition Scenarios to Key Policy Decisions. CoRR abs/2311.06625 (2023) - [i6]Mohammad Reza Belbasi, Aras Selvi, Wolfram Wiesemann:
It's All in the Mix: Wasserstein Machine Learning with Mixed Features. CoRR abs/2312.12230 (2023) - 2022
- [j38]Napat Rujeerapaiboon
Scenario reduction revisited: fundamental limits and guarantees. Math. Program. 191(1): 207-242 (2022) - [j37]Man-Chung Yue
On linear optimization over Wasserstein balls. Math. Program. 195(1): 1107-1122 (2022) - [c9]Chin Pang Ho, Marek Petrik, Wolfram Wiesemann:
Robust $\phi$-Divergence MDPs. NeurIPS 2022 - [c8]Aras Selvi, Mohammad Reza Belbasi, Martin Haugh, Wolfram Wiesemann:
Wasserstein Logistic Regression with Mixed Features. NeurIPS 2022 - [i5]Chin Pang Ho, Marek Petrik, Wolfram Wiesemann:
Robust Phi-Divergence MDPs. CoRR abs/2205.14202 (2022) - 2021
- [j36]Chin Pang Ho, Marek Petrik, Wolfram Wiesemann:
Partial Policy Iteration for L1-Robust Markov Decision Processes. J. Mach. Learn. Res. 22: 275:1-275:46 (2021) - [j35]Josh C. D'aeth
Optimal national prioritization policies for hospital care during the SARS-CoV-2 pandemic. Nat. Comput. Sci. 1(8): 521-531 (2021) - 2020
- [j34]Angelos Georghiou
A Primal-Dual Lifting Scheme for Two-Stage Robust Optimization. Oper. Res. 68(2): 572-590 (2020) - [j33]Shubhechyya Ghosal
The Distributionally Robust Chance-Constrained Vehicle Routing Problem. Oper. Res. 68(3): 716-732 (2020) - [j32]Çagil Koçyigit, Garud Iyengar
Distributionally Robust Mechanism Design. Manag. Sci. 66(1): 159-189 (2020) - [j31]Anirudh Subramanyam, Chrysanthos E. Gounaris, Wolfram Wiesemann:
K-adaptability in two-stage mixed-integer robust optimization. Math. Program. Comput. 12(2): 193-224 (2020) - [i4]Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
On Linear Optimization over Wasserstein Balls. CoRR abs/2004.07162 (2020) - [i3]Chin Pang Ho, Marek Petrik, Wolfram Wiesemann:
Partial Policy Iteration for L1-Robust Markov Decision Processes. CoRR abs/2006.09484 (2020)
2010 – 2019
- 2019
- [j30]Angelos Georghiou
The decision rule approach to optimization under uncertainty: methodology and applications. Comput. Manag. Sci. 16(4): 545-576 (2019) - [j29]Angelos Georghiou
Robust Dual Dynamic Programming. Oper. Res. 67(3): 813-830 (2019) - [j28]Erick Delage
"Dice"-sion-Making Under Uncertainty: When Can a Random Decision Reduce Risk? Manag. Sci. 65(7): 3282-3301 (2019) - [j27]Napat Rujeerapaiboon
Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization. SIAM J. Optim. 29(2): 1211-1239 (2019) - [c7]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization. NeurIPS 2019: 13920-13931 - [c6]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation. NeurIPS 2019: 15846-15856 - [i2]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization. CoRR abs/1910.07817 (2019) - [i1]Viet Anh Nguyen, Soroosh Shafieezadeh-Abadeh, Man-Chung Yue, Daniel Kuhn, Wolfram Wiesemann:
Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation. CoRR abs/1910.10583 (2019) - 2018
- [j26]Napat Rujeerapaiboon
Chebyshev Inequalities for Products of Random Variables. Math. Oper. Res. 43(3): 887-918 (2018) - [j25]Panos Parpas
Special issue: Optimization models and algorithms for data science. Math. Program. 167(1): 1-3 (2018) - [c5]Chin Pang Ho, Marek Petrik, Wolfram Wiesemann:
Fast Bellman Updates for Robust MDPs. ICML 2018: 1984-1993 - 2017
- [j24]Milos Kopa
Special issue on the 12th international conference on computational management science. Comput. Manag. Sci. 14(1): 1-4 (2017) - [j23]Grani Adiwena Hanasusanto, Vladimir Roitch, Daniel Kuhn, Wolfram Wiesemann:
Ambiguous Joint Chance Constraints Under Mean and Dispersion Information. Oper. Res. 65(3): 751-767 (2017) - [j22]Panos Parpas
Guest Editorial. Optim. Methods Softw. 32(4): 669 (2017) - 2016
- [j21]Napat Rujeerapaiboon
Robust Growth-Optimal Portfolios. Manag. Sci. 62(7): 2090-2109 (2016) - [j20]Grani Adiwena Hanasusanto, Daniel Kuhn, Wolfram Wiesemann:
A comment on "computational complexity of stochastic programming problems". Math. Program. 159(1-2): 557-569 (2016) - [j19]Grani Adiwena Hanasusanto, Daniel Kuhn, Wolfram Wiesemann:
K-adaptability in two-stage distributionally robust binary programming. Oper. Res. Lett. 44(1): 6-11 (2016) - [j18]Chrysanthos E. Gounaris
An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem. Transp. Sci. 50(4): 1239-1260 (2016) - 2015
- [j17]Themistoklis Charalambous
On the minimum latency transmission scheduling in wireless networks with power control under SINR constraints. Trans. Emerg. Telecommun. Technol. 26(3): 367-379 (2015) - [j16]Grani Adiwena Hanasusanto, Daniel Kuhn, Wolfram Wiesemann:
K-Adaptability in Two-Stage Robust Binary Programming. Oper. Res. 63(4): 877-891 (2015) - [j15]Eli Gutin, Daniel Kuhn, Wolfram Wiesemann:
Interdiction Games on Markovian PERT Networks. Manag. Sci. 61(5): 999-1017 (2015) - [j14]Grani Adiwena Hanasusanto, Vladimir Roitch, Daniel Kuhn, Wolfram Wiesemann:
A distributionally robust perspective on uncertainty quantification and chance constrained programming. Math. Program. 151(1): 35-62 (2015) - [j13]Angelos Georghiou
Generalized decision rule approximations for stochastic programming via liftings. Math. Program. 152(1-2): 301-338 (2015) - 2014
- [j12]Panos Parpas
Editorial to computational techniques in management science. Comput. Manag. Sci. 11(1-2): 3-4 (2014) - [j11]Wolfram Wiesemann, Daniel Kuhn, Melvyn Sim
Distributionally Robust Convex Optimization. Oper. Res. 62(6): 1358-1376 (2014) - 2013
- [j10]Chrysanthos E. Gounaris
The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty. Oper. Res. 61(3): 677-693 (2013) - [j9]Wolfram Wiesemann, Daniel Kuhn, Berç Rustem:
Robust Markov Decision Processes. Math. Oper. Res. 38(1): 153-183 (2013) - [j8]Wolfram Wiesemann, Angelos Tsoukalas
Pessimistic Bilevel Optimization. SIAM J. Optim. 23(1): 353-380 (2013) - 2012
- [j7]Wolfram Wiesemann, Daniel Kuhn, Berç Rustem:
Multi-resource allocation in stochastic project scheduling. Ann. Oper. Res. 193(1): 193-220 (2012) - [j6]Raquel J. Fonseca
Robust international portfolio management. Comput. Manag. Sci. 9(1): 31-62 (2012) - [j5]Panos Parpas
Editorial. Comput. Manag. Sci. 9(3): 301-302 (2012) - [j4]Simon A. Spacey
Robust Software Partitioning with Multiple Instantiation. INFORMS J. Comput. 24(3): 500-515 (2012) - [j3]Wolfram Wiesemann, Daniel Kuhn, Berç Rustem:
Robust resource allocations in temporal networks. Math. Program. 135(1-2): 437-471 (2012) - 2011
- [j2]Daniel Kuhn, Wolfram Wiesemann, Angelos Georghiou
Primal and dual linear decision rules in stochastic and robust optimization. Math. Program. 130(1): 177-209 (2011) - [c4]Evangelia Kalyvianaki, Wolfram Wiesemann, Quang Hieu Vu, Daniel Kuhn, Peter R. Pietzuch:
SQPR: Stream query planning with reuse. ICDE 2011: 840-851 - 2010
- [b1]Wolfram Wiesemann:
Optimisation of temporal networks under uncertainty. Imperial College London, UK, 2010 - [j1]Wolfram Wiesemann, Daniel Kuhn, Berç Rustem:
Maximizing the net present value of a project under uncertainty. Eur. J. Oper. Res. 202(2): 356-367 (2010)
2000 – 2009
- 2008
- [c3]Wolfram Wiesemann, Ronald Hochreiter
A Stochastic Programming Approach for QoS-Aware Service Composition. CCGRID 2008: 226-233 - 2006
- [c2]Wolfram Wiesemann, Thomas Stützle:
Iterated Ants: An Experimental Study for the Quadratic Assignment Problem. ANTS Workshop 2006: 179-190 - 2005
- [c1]Marco Voss, Wolfram Wiesemann:
Using Reputation Systems to Cope with Trust Problems in Virtual Organizations. WOSIS 2005: 186-195
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: