Esther Julien
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Esther Julien has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Krzysztof Postek
Independent Researcher
3 shared publications - S. Ilker Birbil
Amsterdam Business School, University of Amsterdam, 1018 TV Amsterdam, Netherlands
3 shared publications - Giulia Bernardini
University of Trieste, trieste, Italy
1 shared publication Leen Stougie
CWI, Amsterdam, The Netherlands; Vrije Universiteit, Amsterdam, The Netherlands; INRIA-Erable, France
1 shared publicationLeo van Iersel
Delft Institute of Applied Mathematics, Delft, The Netherlands
1 shared publication
Latest Publications
- 1 May 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (3) , 644-665
Machine Learning for K-Adaptability in Two-Stage Robust Optimization
Two-stage robust optimization problems constitute one of the hardest optimization problem classes. One of the solution approaches to this class of problems is K-adaptability. This approach simultaneously seeks the best partitioning of the uncertainty set of scenarios into K subsets and optimizes decisions corresponding to each of these subsets. In a general case, it is solved using the K-adaptability branch-and-bound algorithm, which requires exploration of exponentially growing solution trees. To accelerate finding high-quality solutions in such trees, we propose a machine learning-based node selection strategy. In particular, we construct a feature engineering scheme based on general two-stage robust optimization insights, which allows us to train our machine learning tool on a database of resolved branch-and-bound trees and to apply it as is to problems of different sizes and/or types. We experimentally show that using our learned node selection strategy outperforms a vanilla, random node selection strategy when tested on problems of the same type as the training problems as well as in cases when the K-value or the problem size differs from the training ones. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work was supported by the Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Grants OCENW.GROOT.2019.015 and VI.Veni.191E.035]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0314 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0314 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 May 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (3) , 644-665
Machine Learning for K-Adaptability in Two-Stage Robust Optimization
Two-stage robust optimization problems constitute one of the hardest optimization problem classes. One of the solution approaches to this class of problems is K-adaptability. This approach simultaneously seeks the best partitioning of the uncertainty set of scenarios into K subsets and optimizes decisions corresponding to each of these subsets. In a general case, it is solved using the K-adaptability branch-and-bound algorithm, which requires exploration of exponentially growing solution trees. To accelerate finding high-quality solutions in such trees, we propose a machine learning-based node selection strategy. In particular, we construct a feature engineering scheme based on general two-stage robust optimization insights, which allows us to train our machine learning tool on a database of resolved branch-and-bound trees and to apply it as is to problems of different sizes and/or types. We experimentally show that using our learned node selection strategy outperforms a vanilla, random node selection strategy when tested on problems of the same type as the training problems as well as in cases when the K-value or the problem size differs from the training ones. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work was supported by the Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Grants OCENW.GROOT.2019.015 and VI.Veni.191E.035]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0314 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0314 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 2 September 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Machine Learning for K-Adaptability in Two-Stage Robust Optimization
This directory contains the code for the K-adaptability branch-and-bound (K-B&B) algorithm, with random node selection and ML-informed node selection (i.e., K-B&B-NodeSelection). K-adaptability is a solution approach for two-stage robust optimization problems.
- 2 September 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Machine Learning for K-Adaptability in Two-Stage Robust Optimization
This directory contains the code for the K-adaptability branch-and-bound (K-B&B) algorithm, with random node selection and ML-informed node selection (i.e., K-B&B-NodeSelection). K-adaptability is a solution approach for two-stage robust optimization problems.
- Open Access
- 17 July 2024
- Published by Elsevier in Molecular Phylogenetics and Evolution
- Vol. 199, 108137
Inferring phylogenetic networks from multifurcating trees via cherry picking and machine learning
- 17 July 2024
- Published by Elsevier in Molecular Phylogenetics and Evolution
- Vol. 199, 108137
Open AccessInferring phylogenetic networks from multifurcating trees via cherry picking and machine learning
- Open Access
Machine Learning for K-adaptability in Two-stage Robust Optimization
Two-stage robust optimization problems constitute one of the hardest optimization problem classes. One of the solution approaches to this class of problems is K-adaptability. This approach simultaneously seeks the best partitioning of the uncertainty set of scenarios into K subsets, and optimizes decisions corresponding to each of these subsets. In general case, it is solved using the K-adaptability branch-and-bound algorithm, which requires exploration of exponentially-growing solution trees. To accelerate finding high-quality solutions in such trees, we propose a machine learning-based node selection strategy. In particular, we construct a feature engineering scheme based on general two-stage robust optimization insights that allows us to train our machine learning tool on a database of resolved B&B trees, and to apply it as-is to problems of different sizes and/or types. We experimentally show that using our learned node selection strategy outperforms a vanilla, random node selection strategy when tested on problems of the same type as the training problems, also in case the K-value or the problem size differs from the training ones.
Open AccessMachine Learning for K-adaptability in Two-stage Robust Optimization
Two-stage robust optimization problems constitute one of the hardest optimization problem classes. One of the solution approaches to this class of problems is K-adaptability. This approach simultaneously seeks the best partitioning of the uncertainty set of scenarios into K subsets, and optimizes decisions corresponding to each of these subsets. In general case, it is solved using the K-adaptability branch-and-bound algorithm, which requires exploration of exponentially-growing solution trees. To accelerate finding high-quality solutions in such trees, we propose a machine learning-based node selection strategy. In particular, we construct a feature engineering scheme based on general two-stage robust optimization insights that allows us to train our machine learning tool on a database of resolved B&B trees, and to apply it as-is to problems of different sizes and/or types. We experimentally show that using our learned node selection strategy outperforms a vanilla, random node selection strategy when tested on problems of the same type as the training problems, also in case the K-value or the problem size differs from the training ones.