Wolfram Wiesemann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Wolfram Wiesemann has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Kuhn
Risk Analytics and Optimization Chair, École Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland
15 shared publications - Man-Chung Yue
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Hong Kong
5 shared publications - Angelos Georghiou
Department of Business and Public Administration, University of Cyprus, Nicosia 1678, Cyprus
3 shared publications - Angelos Tsoukalas
Department of Technology and Operations Management, RSM Erasmus University Rotterdam, Rotterdam, Netherlands
3 shared publications - Aras Selvi
Imperial College Business School Imperial College London United Kingdom
3 shared publications - Chin Pang Ho
Department of Data Science, City University of Hong Kong, Hong Kong
3 shared publications
Latest Publications
- 1 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (5) , 2728-2747
An MILP-Based Solution Scheme for Factored Markov Decision Processes
Off-the-Shelf Solvers Take on the Curse of Dimensionality Many real-world decision problems—from managing power plants and microgrids to coordinating fleets of robots, recommender systems, and traffic networks—involve dynamics and rewards that decompose into smaller, loosely interacting components. Factored Markov decision processes (FMDPs) exploit this structure to escape the curse of dimensionality, but they have traditionally been solved with bespoke algorithms that require painstaking implementation and substantial fine-tuning. In this issue, Liu, Wiesemann, and Yue introduce a new mathematical programming perspective on FMDPs that swaps hand-crafted machinery for off-the-shelf optimization solvers. By encoding sparse dependencies through mixed-integer linear programming–representable feature vectors, their formulation exploits factored structure in both states and actions, unifies and extends existing treatments of context-specific independence, and pairs an approximate linear program with a novel cutting-plane algorithm. Companion feature-learning and dynamic-basis routines further enhance scalability, and computational experiments across stylized and operational case studies illustrate the method’s promise.
- 1 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (5) , 2728-2747
An MILP-Based Solution Scheme for Factored Markov Decision Processes
Off-the-Shelf Solvers Take on the Curse of Dimensionality Many real-world decision problems—from managing power plants and microgrids to coordinating fleets of robots, recommender systems, and traffic networks—involve dynamics and rewards that decompose into smaller, loosely interacting components. Factored Markov decision processes (FMDPs) exploit this structure to escape the curse of dimensionality, but they have traditionally been solved with bespoke algorithms that require painstaking implementation and substantial fine-tuning. In this issue, Liu, Wiesemann, and Yue introduce a new mathematical programming perspective on FMDPs that swaps hand-crafted machinery for off-the-shelf optimization solvers. By encoding sparse dependencies through mixed-integer linear programming–representable feature vectors, their formulation exploits factored structure in both states and actions, unifies and extends existing treatments of context-specific independence, and pairs an approximate linear program with a novel cutting-plane algorithm. Companion feature-learning and dynamic-basis routines further enhance scalability, and computational experiments across stylized and operational case studies illustrate the method’s promise.
- 9 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
It’s All in the Mix: Wasserstein Classification and Regression with Mixed Features
Problem definition: A key challenge in supervised learning is data scarcity, which can cause prediction models to overfit to the training data and perform poorly out of sample. A contemporary approach to combat overfitting is offered by distributionally robust problem formulations that consider all data-generating distributions close to the empirical distribution derived from historical samples, where “closeness” is determined by the Wasserstein distance. Although such formulations show significant promise in prediction tasks where all input features are continuous, they scale exponentially when discrete features are present. Methodology/results: We demonstrate that distributionally robust mixed-feature classification and regression problems can indeed be solved in polynomial time. Our proof relies on classical ellipsoid method-based solution schemes that do not scale well in practice. To overcome this limitation, we develop a practically efficient (yet, in the worst case, exponential-time) cutting-plane-based algorithm that admits a polynomial-time separation oracle, despite the presence of exponentially many constraints. We compare our method against alternative techniques both theoretically and empirically on standard benchmark instances. Managerial implications: Data-driven operations management problems often involve prediction models with discrete features. We develop and analyze distributionally robust prediction models that faithfully account for the presence of discrete features, and we demonstrate that our models can significantly outperform existing methods that are agnostic to the presence of discrete features both theoretically and on standard benchmark instances. Funding: This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) [Grant EP/W003317/1]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.0738 .
- 9 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
It’s All in the Mix: Wasserstein Classification and Regression with Mixed Features
Problem definition: A key challenge in supervised learning is data scarcity, which can cause prediction models to overfit to the training data and perform poorly out of sample. A contemporary approach to combat overfitting is offered by distributionally robust problem formulations that consider all data-generating distributions close to the empirical distribution derived from historical samples, where “closeness” is determined by the Wasserstein distance. Although such formulations show significant promise in prediction tasks where all input features are continuous, they scale exponentially when discrete features are present. Methodology/results: We demonstrate that distributionally robust mixed-feature classification and regression problems can indeed be solved in polynomial time. Our proof relies on classical ellipsoid method-based solution schemes that do not scale well in practice. To overcome this limitation, we develop a practically efficient (yet, in the worst case, exponential-time) cutting-plane-based algorithm that admits a polynomial-time separation oracle, despite the presence of exponentially many constraints. We compare our method against alternative techniques both theoretically and empirically on standard benchmark instances. Managerial implications: Data-driven operations management problems often involve prediction models with discrete features. We develop and analyze distributionally robust prediction models that faithfully account for the presence of discrete features, and we demonstrate that our models can significantly outperform existing methods that are agnostic to the presence of discrete features both theoretically and on standard benchmark instances. Funding: This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) [Grant EP/W003317/1]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.0738 .
- 23 February 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (4) , 2075-2087
A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization
Sharper Approximation for Multistage Decisions Under Uncertainty In “A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization,” Thomä, Schiffer, and Wiesemann revisit piecewise affine decision rules, a widely used approximation for multistage stochastic programs. Building on the framework of Georghiou et al. (2015), the authors propose an algorithmic refinement that yields strictly better policies in stochastic settings while retaining tractability. Beyond stochastic programming, the framework naturally extends to multistage robust optimization and to modern data-driven models based on Wasserstein ambiguity sets. The paper shows how the resulting policies can be computed efficiently and provides numerical evidence demonstrating consistent performance improvements.
- 23 February 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (4) , 2075-2087
A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization
Sharper Approximation for Multistage Decisions Under Uncertainty In “A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization,” Thomä, Schiffer, and Wiesemann revisit piecewise affine decision rules, a widely used approximation for multistage stochastic programs. Building on the framework of Georghiou et al. (2015), the authors propose an algorithmic refinement that yields strictly better policies in stochastic settings while retaining tractability. Beyond stochastic programming, the framework naturally extends to multistage robust optimization and to modern data-driven models based on Wasserstein ambiguity sets. The paper shows how the resulting policies can be computed efficiently and provides numerical evidence demonstrating consistent performance improvements.
- Open Access
Efficient Algorithms for Robust Markov Decision Processes with $s$-Rectangular Ambiguity Sets
Robust Markov decision processes (MDPs) have attracted significant interest due to their ability to protect MDPs from poor out-of-sample performance in the presence of ambiguity. In contrast to classical MDPs, which account for stochasticity by modeling the dynamics through a stochastic process with a known transition kernel, a robust MDP additionally accounts for ambiguity by optimizing against the most adverse transition kernel from an ambiguity set constructed via historical data. In this paper, we develop a unified solution framework for a broad class of robust MDPs with $s$-rectangular ambiguity sets, where the most adverse transition probabilities are considered independently for each state. Using our algorithms, we show that $s$-rectangular robust MDPs with $1$- and $2$-norm as well as $φ$-divergence ambiguity sets can be solved several orders of magnitude faster than with state-of-the-art commercial solvers, and often only a logarithmic factor slower than classical MDPs. We demonstrate the favorable scaling properties of our algorithms on a range of synthetically generated as well as standard benchmark instances.
Open AccessEfficient Algorithms for Robust Markov Decision Processes with $s$-Rectangular Ambiguity Sets
Robust Markov decision processes (MDPs) have attracted significant interest due to their ability to protect MDPs from poor out-of-sample performance in the presence of ambiguity. In contrast to classical MDPs, which account for stochasticity by modeling the dynamics through a stochastic process with a known transition kernel, a robust MDP additionally accounts for ambiguity by optimizing against the most adverse transition kernel from an ambiguity set constructed via historical data. In this paper, we develop a unified solution framework for a broad class of robust MDPs with $s$-rectangular ambiguity sets, where the most adverse transition probabilities are considered independently for each state. Using our algorithms, we show that $s$-rectangular robust MDPs with $1$- and $2$-norm as well as $φ$-divergence ambiguity sets can be solved several orders of magnitude faster than with state-of-the-art commercial solvers, and often only a logarithmic factor slower than classical MDPs. We demonstrate the favorable scaling properties of our algorithms on a range of synthetically generated as well as standard benchmark instances.
- 1 February 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 72 (2) , 1456-1471
On the Optimality of Affine Decision Rules in Distributionally Robust Optimization
We propose conditions under which two-stage distributionally robust optimization problems are optimally solved in affine or K-adaptable affine decision rules. Contrary to previous work, our conditions do not impose any structure on the support of the uncertain parameters, and they ensure pointwise (as opposed to worst case) optimality of (K-adaptable) affine decision rules. The absence of support restrictions allows us to transfer nonlinearities from the problem description to the support via liftings, whereas the pointwise optimality implies that decision rules remain optimal for broad classes of distributionally robust optimization problems, including data-driven problems over [ ]-divergence or Wasserstein ambiguity sets. We demonstrate how our conditions can be met in two applications. This paper was accepted by Chung Piaw Teo, optimization and decision analytics. Funding: This work was supported by Engineering and Physical Sciences Research Council (EPSRC) [Grant EP/W003317/1]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2023.00053 .
- 1 February 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 72 (2) , 1456-1471
On the Optimality of Affine Decision Rules in Distributionally Robust Optimization
We propose conditions under which two-stage distributionally robust optimization problems are optimally solved in affine or K-adaptable affine decision rules. Contrary to previous work, our conditions do not impose any structure on the support of the uncertain parameters, and they ensure pointwise (as opposed to worst case) optimality of (K-adaptable) affine decision rules. The absence of support restrictions allows us to transfer nonlinearities from the problem description to the support via liftings, whereas the pointwise optimality implies that decision rules remain optimal for broad classes of distributionally robust optimization problems, including data-driven problems over [ ]-divergence or Wasserstein ambiguity sets. We demonstrate how our conditions can be met in two applications. This paper was accepted by Chung Piaw Teo, optimization and decision analytics. Funding: This work was supported by Engineering and Physical Sciences Research Council (EPSRC) [Grant EP/W003317/1]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2023.00053 .
- Top Cited Papers
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (1) , 356-376
Differential Privacy via Distributionally Robust Optimization
Privacy-Accuracy Trade-off from an Optimization Lens: Fix a Desired Level of Privacy, Then Maximize Accuracy In differential privacy, the de facto standard for safeguarding individual information in data analysis, noise is added to statistics to limit the disclosure of sensitive information. Greater privacy requires more noise, creating a trade-off as the added noise reduces the accuracy of the resulting statistics. Historically, researchers have addressed this by restricting themselves to families of noise mechanisms that are sufficient for a predefined privacy level and proving their performance under specific conditions. Selvi, Liu, and Wiesemann propose a novel approach that guarantees optimal accuracy for any specified privacy level. They formulate the design of privacy mechanisms as an optimization problem that minimizes the expected loss associated with the random noise mechanism while encoding differential privacy as constraints. Through detailed analyses and by leveraging tools from distributionally robust optimization, they develop an efficient optimization algorithm and derive implementable solutions with provable guarantees to solve the problem within seconds.
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 74 (1) , 356-376
Top Cited PapersDifferential Privacy via Distributionally Robust Optimization
Privacy-Accuracy Trade-off from an Optimization Lens: Fix a Desired Level of Privacy, Then Maximize Accuracy In differential privacy, the de facto standard for safeguarding individual information in data analysis, noise is added to statistics to limit the disclosure of sensitive information. Greater privacy requires more noise, creating a trade-off as the added noise reduces the accuracy of the resulting statistics. Historically, researchers have addressed this by restricting themselves to families of noise mechanisms that are sufficient for a predefined privacy level and proving their performance under specific conditions. Selvi, Liu, and Wiesemann propose a novel approach that guarantees optimal accuracy for any specified privacy level. They formulate the design of privacy mechanisms as an optimization problem that minimizes the expected loss associated with the random noise mechanism while encoding differential privacy as constraints. Through detailed analyses and by leveraging tools from distributionally robust optimization, they develop an efficient optimization algorithm and derive implementable solutions with provable guarantees to solve the problem within seconds.
- 1 November 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (6) , 3345-3358
Technical Note—Multistage Robust Mixed-Integer Programming
In the paper “Multistage Robust Mixed-Integer Programming,” Krzysztof Postek, Ward Romeijnders, and Wolfram Wiesemann study multistage robust mixed-integer programming problems, a popular and powerful yet computationally demanding framework for decision making under uncertainty. The authors leverage dynamic programming principles to decompose multistage problems into large numbers of two-stage subproblems, and they use the finite adaptability approach to solve the latter to exact or approximate optimality. The resulting method allows for efficient parallelization, and the authors showcase its effectiveness on route planning and location-transportation problems.
- 1 November 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (6) , 3345-3358
Technical Note—Multistage Robust Mixed-Integer Programming
In the paper “Multistage Robust Mixed-Integer Programming,” Krzysztof Postek, Ward Romeijnders, and Wolfram Wiesemann study multistage robust mixed-integer programming problems, a popular and powerful yet computationally demanding framework for decision making under uncertainty. The authors leverage dynamic programming principles to decompose multistage problems into large numbers of two-stage subproblems, and they use the finite adaptability approach to solve the latter to exact or approximate optimality. The resulting method allows for efficient parallelization, and the authors showcase its effectiveness on route planning and location-transportation problems.
- Top Cited Papers
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (2) , 862-878
A Unified Theory of Robust and Distributionally Robust Optimization via the Primal-Worst-Equals-Dual-Best Principle
A Primal-Worst-Equals-Dual-Best Perspective on Robust and Distributionally Robust Optimization In the paper “A Unified Theory of Robust and Distributionally Robust Optimization via the Primal-Worst-Equals-Dual-Best Principle,” Jianzhe Zhen, Daniel Kuhn, and Wolfram Wiesemann develop a generalized “primal-worst-equals-dual-best” principle that establishes strong duality between semi-infinite primal worst and nonconvex dual best formulations of robust and distributionally robust nonlinear optimization problems. Their theory offers an alternative characterization of (distributionally) robust optimization problems that bypasses the need to mobilize the machinery of abstract semi-infinite duality theory. The paper will be of interest to researchers and practitioners in the field of optimization under uncertainty.
- 1 March 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (2) , 862-878
Top Cited PapersA Unified Theory of Robust and Distributionally Robust Optimization via the Primal-Worst-Equals-Dual-Best Principle
A Primal-Worst-Equals-Dual-Best Perspective on Robust and Distributionally Robust Optimization In the paper “A Unified Theory of Robust and Distributionally Robust Optimization via the Primal-Worst-Equals-Dual-Best Principle,” Jianzhe Zhen, Daniel Kuhn, and Wolfram Wiesemann develop a generalized “primal-worst-equals-dual-best” principle that establishes strong duality between semi-infinite primal worst and nonconvex dual best formulations of robust and distributionally robust nonlinear optimization problems. Their theory offers an alternative characterization of (distributionally) robust optimization problems that bypasses the need to mobilize the machinery of abstract semi-infinite duality theory. The paper will be of interest to researchers and practitioners in the field of optimization under uncertainty.
- 1 September 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 72 (5) , 2042-2060
Randomized Assortment Optimization
When a firm selects an assortment of products to offer to customers, it uses a choice model to anticipate their probability of purchasing each product. In practice, the estimation of these models is subject to statistical errors, which may lead to significantly suboptimal assortment decisions. In “Randomized Assortment Optimization,” Wang, Peura, and Wiesemann show that the standard approach of deterministically selecting a single assortment to offer is not always optimal in this setting: Instead, the firm can do better by selecting an assortment randomly according to a prudently designed probability distribution. The authors show how an optimal randomization strategy can be determined for common choice models, improving performance in realistic data-driven settings. The results suggest that more general versions of the assortment optimization problem—incorporating business constraints, more flexible choice models and/or more general forms of uncertainty—tend to be more receptive to the benefits of randomization.
- 1 September 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 72 (5) , 2042-2060
Randomized Assortment Optimization
When a firm selects an assortment of products to offer to customers, it uses a choice model to anticipate their probability of purchasing each product. In practice, the estimation of these models is subject to statistical errors, which may lead to significantly suboptimal assortment decisions. In “Randomized Assortment Optimization,” Wang, Peura, and Wiesemann show that the standard approach of deterministically selecting a single assortment to offer is not always optimal in this setting: Instead, the firm can do better by selecting an assortment randomly according to a prudently designed probability distribution. The authors show how an optimal randomization strategy can be determined for common choice models, improving performance in realistic data-driven settings. The results suggest that more general versions of the assortment optimization problem—incorporating business constraints, more flexible choice models and/or more general forms of uncertainty—tend to be more receptive to the benefits of randomization.
- Open Access
An MILP-Based Solution Scheme for Factored and Robust Factored Markov Decision Processes
Factored Markov decision processes (MDPs) are a prominent paradigm within the artificial intelligence community for modeling and solving large-scale MDPs whose rewards and dynamics decompose into smaller, loosely interacting components. Through the use of dynamic Bayesian networks and context-specific independence, factored MDPs can achieve an exponential reduction in the state space of an MDP and thus scale to problem sizes that are beyond the reach of classical MDP algorithms. However, factored MDPs are typically solved using custom-designed algorithms that can require meticulous implementations and considerable fine-tuning. In this paper, we propose a mathematical programming approach to solving factored MDPs. In contrast to existing solution schemes, our approach leverages off-the-shelf solvers, which allows for a streamlined implementation and maintenance; it effectively capitalizes on the factored structure present in both state and action spaces; and it readily extends to the largely unexplored class of robust factored MDPs, whose transition kernels are only known to reside in a pre-specified ambiguity set. Our numerical experiments demonstrate the potential of our approach.
Open AccessAn MILP-Based Solution Scheme for Factored and Robust Factored Markov Decision Processes
Factored Markov decision processes (MDPs) are a prominent paradigm within the artificial intelligence community for modeling and solving large-scale MDPs whose rewards and dynamics decompose into smaller, loosely interacting components. Through the use of dynamic Bayesian networks and context-specific independence, factored MDPs can achieve an exponential reduction in the state space of an MDP and thus scale to problem sizes that are beyond the reach of classical MDP algorithms. However, factored MDPs are typically solved using custom-designed algorithms that can require meticulous implementations and considerable fine-tuning. In this paper, we propose a mathematical programming approach to solving factored MDPs. In contrast to existing solution schemes, our approach leverages off-the-shelf solvers, which allows for a streamlined implementation and maintenance; it effectively capitalizes on the factored structure present in both state and action spaces; and it readily extends to the largely unexplored class of robust factored MDPs, whose transition kernels are only known to reside in a pre-specified ambiguity set. Our numerical experiments demonstrate the potential of our approach.