Wolfram Wiesemann

According to our database1, Wolfram Wiesemann authored at least 45 papers between 2005 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


Scenario reduction revisited: fundamental limits and guarantees.
Math. Program., 2022

Robust Phi-Divergence MDPs.
CoRR, 2022

Partial Policy Iteration for L1-Robust Markov Decision Processes.
J. Mach. Learn. Res., 2021

<i>K</i>-adaptability in two-stage mixed-integer robust optimization.
Math. Program. Comput., 2020

Distributionally Robust Mechanism Design.
Manag. Sci., 2020

The Distributionally Robust Chance-Constrained Vehicle Routing Problem.
Oper. Res., 2020

A Primal-Dual Lifting Scheme for Two-Stage Robust Optimization.
Oper. Res., 2020

On Linear Optimization over Wasserstein Balls.
CoRR, 2020

Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization.
SIAM J. Optim., 2019

"Dice"-sion-Making Under Uncertainty: When Can a Random Decision Reduce Risk?
Manag. Sci., 2019

Robust Dual Dynamic Programming.
Oper. Res., 2019

The decision rule approach to optimization under uncertainty: methodology and applications.
Comput. Manag. Sci., 2019

Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Special issue: Optimization models and algorithms for data science.
Math. Program., 2018

Chebyshev Inequalities for Products of Random Variables.
Math. Oper. Res., 2018

Fast Bellman Updates for Robust MDPs.
Proceedings of the 35th International Conference on Machine Learning, 2018

Guest Editorial.
Optim. Methods Softw., 2017

Ambiguous Joint Chance Constraints Under Mean and Dispersion Information.
Oper. Res., 2017

Special issue on the 12th international conference on computational management science.
Comput. Manag. Sci., 2017

An Adaptive Memory Programming Framework for the Robust Capacitated Vehicle Routing Problem.
Transp. Sci., 2016

K-adaptability in two-stage distributionally robust binary programming.
Oper. Res. Lett., 2016

A comment on "computational complexity of stochastic programming problems".
Math. Program., 2016

Robust Growth-Optimal Portfolios.
Manag. Sci., 2016

A distributionally robust perspective on uncertainty quantification and chance constrained programming.
Math. Program., 2015

Generalized decision rule approximations for stochastic programming via liftings.
Math. Program., 2015

Interdiction Games on Markovian PERT Networks.
Manag. Sci., 2015

<i>K</i>-Adaptability in Two-Stage Robust Binary Programming.
Oper. Res., 2015

Distributionally Robust Convex Optimization.
Oper. Res., 2014

Editorial to computational techniques in management science.
Comput. Manag. Sci., 2014

Pessimistic Bilevel Optimization.
SIAM J. Optim., 2013

Robust Markov Decision Processes.
Math. Oper. Res., 2013

The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty.
Oper. Res., 2013

Robust resource allocations in temporal networks.
Math. Program., 2012

Robust Software Partitioning with Multiple Instantiation.
INFORMS J. Comput., 2012

Comput. Manag. Sci., 2012

Robust international portfolio management.
Comput. Manag. Sci., 2012

Multi-resource allocation in stochastic project scheduling.
Ann. Oper. Res., 2012

Primal and dual linear decision rules in stochastic and robust optimization.
Math. Program., 2011

SQPR: Stream query planning with reuse.
Proceedings of the 27th International Conference on Data Engineering, 2011

Optimisation of temporal networks under uncertainty.
PhD thesis, 2010

Maximizing the net present value of a project under uncertainty.
Eur. J. Oper. Res., 2010

A Stochastic Programming Approach for QoS-Aware Service Composition.
Proceedings of the 8th IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2008), 2008

Iterated Ants: An Experimental Study for the Quadratic Assignment Problem.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2006

Using Reputation Systems to Cope with Trust Problems in Virtual Organizations.
Proceedings of the Security in Information Systems, 2005