Publications associées à On the computational complexity of periodic scheduling

Publications associées (36)

Convex Computation of Value-at-risk Bounds for Stochastic Processes

This article formulates algorithms to upper-bound the maximum value-at-risk (VaR) of a state function along trajectories of stochastic processes. The VaR is upper bounded by two methods: minimax tail-bounds (Cantelli/Vysochanskij-Petunin) and Expected Shor ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2025

A shortcut model for batch distillation columns using pertinent effective factors

Dominique Bonvin

A shortcut model is a low-order model that provides a simplified representation of a complex process, thereby enabling faster and more efficient analysis, design and optimization without the computational intensity of a full-scale model. For continuous dis ...

Elsevier2025

Preliminary Sensitivity Analysis of Time-Dependent Code Outputs in Fuel Performance Models Using OFFBEAT for Future Calibration

Mathieu Hursin, Alessandro Scolaro, Edoardo Luciano Brunetto, Sara Maccario

Fuel performance codes are essential for predicting fuel rod behavior in nuclear reactors. These codes comprise a complex system of models with empirical constants that require calibration against experimental data. To support this calibration, this study ...

American Nuclear Society2025

Integer Linear Programming for Unsupervised Training Set Selection in Molecular Machine Learning

Anne-Clémence Corminboeuf, Friedrich Eisenbrand, Rubén Laplaza Solanas, Puck Elisabeth van Gerwen, Ksenia Briling, Jan Weinreich, Matthieu Nicolas Haeberle

Integer linear programming (ILP) is an elegant approach to solve linear optimization problems, naturally described using integer decision variables. Within the context of physics-inspired machine learning (ML) applied to chemistry, we demonstrate the relev ...

IOP Publishing Ltd2025

Enabling Deep Learning Models for Seizure Monitoring within Wearables Lifecycle

Alireza Amirshahi

Continuous monitoring of various physiological conditions enables early detection of potential health issues. The monitoring offers real-time insights into patient well-being and rapid medical interventions. As a case study, in epilepsy, a prevalent neurol ...

EPFL2025

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Paul Scharnhorst

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

EPFL2024

A ride time-oriented scheduling algorithm for dial-a-ride problems

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Pergamon-Elsevier Science Ltd2024

OASIS: An integrated optimisation framework for activity scheduling

Janody Pougala

Activity-based models offer the potential for a far deeper understanding of daily mobility behaviour than trip-based models. Based on the fundamental assumption that travel demand is derived from the need to do activities, they are flexible tools that aim ...

EPFL2024

Energy Management of Price-Maker Community Energy Storage by Stochastic Dynamic Programming

Xue Zhang, Tianshu Yang

In this paper, we propose an analytical stochastic dynamic programming (SDP) algorithm to address the optimal management problem of price-maker community energy storage. As a price-maker, energy storage smooths price differences, thus decreasing energy arb ...

China Electric Power Research Inst2024

Reactive collision-free motion generation in joint space via dynamical systems and sampling-based MPC

Aude Billard, Nadia Barbara Figueroa Fernandez, Mikhail Koptev

Dynamical system (DS) based motion planning offers collision-free motion, with closed-loop reactivity thanks to their analytical expression. It ensures that obstacles are not penetrated by reshaping a nominal DS through matrix modulation, which is construc ...

Sage Publications Ltd2024

Reliable data-driven decision-making through optimal transport

Bahar Taskesen

Decision-making permeates every aspect of human and societal development, from individuals' daily choices to the complex decisions made by communities and institutions. Central to effective decision-making is the discipline of optimization, which seeks th ...

EPFL2024

Separations in Proof Complexity and TFNP

Mika Tapani Göös, Gilbert Théodore Maystre

It is well-known that Resolution proofs can be efficiently simulated by Sherali-Adams (SA) proofs. We show, however, that any such simulation needs to exploit huge coefficients: Resolution cannot be efficiently simulated by SA when the coefficients are wri ...

ASSOC COMPUTING MACHINERY2024

Functional-Basis Analysis of Non-Stationary Signals in Modern Power Grids: Theory and Implementation in Embedded Systems

Alexandra Cameron Karpilow

Situational awareness strategies are essential for the reliable and secure operation of the electric power grid which represents critical infrastructure in modern society. With the rise of converter-interfaced renewable generation and the consequent shift ...

EPFL2024

Identification of typical district configurations: A two-step global sensitivity analysis framework

François Maréchal, Jonas Schnidrig, Cédric Terrier, Arthur Antoine Chuat

The recent geopolitical conflicts in Europe have underscored the vulnerability of the current energy system to the volatility of energy carrier prices. In the prospect of defining robust energy systems ensuring sustainable energy supply in the future, the ...

Pergamon-Elsevier Science Ltd2024

Quantum Protocols for ML, Physics, and Finance

Grzegorz Adam Gluch

In this thesis, we give new protocols that offer a quantum advantage for problems in ML, Physics, and Finance. Quantum mechanics gives predictions that are inconsistent with local realism. The experiment proving this fact (Bell, 1964) gives a quantum proto ...

EPFL2024

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Richard Lee Davis, Engin Walter Bumbacher, Jérôme Guillaume Brender

How to measure students' Computational Problem-Solving (CPS) competencies is an ongoing research topic. Prevalent approaches vary by measurement tools (e.g., interactive programming, multiple-choice tests, or programming-independent tests) and task types ( ...

Association for Computing Machinery2024

Results on Sparse Integer Programming and Geometric Independent Sets

Jana Tabea Cslovjecsek

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

EPFL2023

Succinct ordering and aggregation constraints in algebraic array theories

Viktor Kuncak, Rodrigo Raya

We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...

Elsevier Science Inc2024

Efficient Continual Finite-Sum Minimization

Ioannis Mavrothalassitis, Volkan Cevher, Leello Tadesse Dadi, Efstratios Panteleimon Skoulakis

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023