Constraint-specific recovery networks for solving airline recovery problems

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

An integer vector 𝑏 ∈ Z𝑑 is a degree sequence if there exists a hypergraph with vertices {1, … , 𝑑} such that each 𝑏𝑖 is the number of hyperedges containing 𝑖. The degree-sequence polytope 𝒵 𝑑 is the convex hull of all degree sequences. We show that all bu ...

Distributed optimization is the standard way of speeding up machine learning training, and most of the research in the area focuses on distributed first-order, gradient-based methods. Yet, there are settings where some computationally-bounded nodes may not ...

Train-induced airflows (TIA) have a considerable effect on the thermal environment and the cooling of underground metro stations (UMSs). However, few studies have specifically examined the relationship between the train arrival time interval and TIA's patt ...

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 ...

Probing the architecture of neuronal circuits and the principles that underlie their functional organization remains an important challenge of modern neurosciences. This holds true, in particular, for the inference of neuronal connectivity from large-scale ...

In the first part of this thesis, we present and compare several approaches for the determination of the steady-state of large-scale Markov chains with an underlying low-rank tensor structure. Such structure is, in our context of interest, associated with ...

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 ...

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 ...

Background: The gene family-free framework for comparative genomics aims at providing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity graph. We study two problems related to the b ...

Unexpected disruptions occur for many reasons in railway networks and cause delays, cancelations, and, eventually, passenger inconvenience. This research focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of larg ...

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 ...

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 ...

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

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 ...

The aim of this paper is to analyze and to improve the current planning process of the passenger railway service in light of the recent railway market changes. In order to do so, we introduce the Passenger Centric Train Timetabling Problem. The originality ...

Stochastic programming provides a versatile framework for decision-making under uncertainty, but the resulting optimization problems can be computationally demanding. It has recently been shown that, primal and dual linear decision rule approximations can ...

We study an important case of integer linear programs (ILPs) of the form max{c(T)x vertical bar Ax = b, l

In free viewpoint video, a viewer can choose at will any camera angle or the so-called "virtual view" to observe a dynamic 3-D scene, enhancing his/her depth perception. The virtual view is synthesized using texture and depth videos of two anchor camera vi ...

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 ...

Constraint-specific recovery networks for solving airline recovery problems

Chattez avec Graph Search

Integer points in the degree-sequence polytope

Hybrid Decentralized Optimization: Leveraging Both First- and Zeroth-Order Optimizers for Faster Convergence

An empirical study estimating train-induced airflow rate and its effect on the cooling load of underground stations

The Two Times Problem: Where Is the Problem?

Ensemble learning and ground-truth validation of synaptic connectivity inferred from spike trains

Low-rank tensor methods for large Markov chains and forward feature selection methods

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

The gene family-free median of three

New Network Architectures, Protocols, And Algorithms For Time-Sensitive Applications

The multi-objective railway timetable rescheduling problem

Streaming and Matching Problems with Submodular Functions

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

Approximation algorithms for geometric dispersion

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

Passenger Centric Train Timetabling Problem

Generalized Decision Rule Approximations for Stochastic Programming via Liftings

NEAR-LINEAR TIME ALGORITHM FOR n-FOLD ILPs VIA COLOR CODING

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

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