Publication

Constraint-specific recovery networks for solving airline recovery problems

Related publications (21)

The Two Times Problem: Where Is the Problem?

Gruber et al. (2022) offered a framework how to explain "Physical time within human time", solving the 'two times problem: Here, I am asking whether such a problem exists at all. To question the question, I will appeal to neurobiological, evolutionary, and ...

Brill2024

Hands-on tasks make learning visible: a learning analytics lens on the development of mechanistic problem-solving expertise in makerspaces

Richard Lee Davis, Bertrand Roland Schneider

This study investigated the impact of participating in a year-long digital-fabrication course on high-school seniors' problem-solving skills, with a focus on problems involving mechanistic systems. The research questions centered on whether working in a ma ...

Springer2023

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Yunus Inan

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

EPFL2023

Streaming and Matching Problems with Submodular Functions

Paritosh Garg

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

EPFL2022

Data-based model maintenance in the era of industry 4.0: A methodology

Dimitrios Kyritsis, Antoine Pélissier, Foivos Psarommatis Giannakopoulos

Despite the high number of investments for data-based models in the expansion of Industry 4.0, too little effort has been made to ensure the maintenance of those models. In a data-streaming environment, data-based models are subject to concept drifts. A co ...

ELSEVIER SCI LTD2022

A unifying framework for form-finding and topology-finding of tensegrity structures

Yafeng Wang

This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...

PERGAMON-ELSEVIER SCIENCE LTD2021

A general framework for the integration of complex choice models into mixed integer optimization

Meritxell Pacheco Paneque

The objective of this thesis is to develop a general methodology to incorporate a disaggregate demand representation in supply-oriented optimization problems that allows to capture the interplay between the behavior of individuals and the decisions to be o ...

EPFL2020

Model-based predictive control methods for distributed energy resources in smart grids

Luca Fabietti

This thesis develops optimization-based techniques for the control of distributed energy resources to provide multiple services to the power network. It is divided into three parts. The first part of this thesis focuses on the development of a framework f ...

EPFL2019

Deep Learning for Music: Similarity Search and Beyond

Matthieu Gaston Michel Albert Devaux

This paper is a study on the use of Machine Learning and Deep Learning to determine the similarity between different musics. The first part introduces the framework used and some concepts of Deep Learning that will be used in the algorithms. The second par ...

2019

The Two Times Problem: Where Is the Problem?

Michael Herzog

Brill2024

Hands-on tasks make learning visible: a learning analytics lens on the development of mechanistic problem-solving expertise in makerspaces

Richard Lee Davis, Bertrand Roland Schneider

Springer2023

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Constraint-specific recovery networks for solving airline recovery problems

The Two Times Problem: Where Is the Problem?

Hands-on tasks make learning visible: a learning analytics lens on the development of mechanistic problem-solving expertise in makerspaces

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Streaming and Matching Problems with Submodular Functions

Data-based model maintenance in the era of industry 4.0: A methodology

A unifying framework for form-finding and topology-finding of tensegrity structures

A general framework for the integration of complex choice models into mixed integer optimization

Model-based predictive control methods for distributed energy resources in smart grids

Deep Learning for Music: Similarity Search and Beyond

Graph Chatbot

The Two Times Problem: Where Is the Problem?

Hands-on tasks make learning visible: a learning analytics lens on the development of mechanistic problem-solving expertise in makerspaces

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Streaming and Matching Problems with Submodular Functions

Data-based model maintenance in the era of industry 4.0: A methodology

A unifying framework for form-finding and topology-finding of tensegrity structures

A general framework for the integration of complex choice models into mixed integer optimization

New Results in Integer and Lattice Programming

Model-based predictive control methods for distributed energy resources in smart grids

Deep Learning for Music: Similarity Search and Beyond

New Results in Integer and Lattice Programming