A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this study, we integrate a schedule design and fleet assignment model and a demand model into an optimization problem to maximize the revenue of an airline. The model considers spill and recapture effects to cope with capacity restrictions. For the dema ...
This thesis deals with models and methods for large scale optimization problems; in particular, we focus on decision problems arising in the context of seaport container terminals for the efficient management of terminal operations. Large-scale optimizatio ...
We focus on image restoration that consists in regularizing a quadratic data-fidelity term with the standard l1 sparse-enforcing norm. We propose a novel algorithmic approach to solve this optimization problem. Our idea amounts to approximating the result ...
In this work, we exploit the fact that wavelets can represent magnetic resonance images well, with relatively few coefficients. We use this property to improve magnetic resonance imaging (MRI) reconstructions from undersampled data with arbitrary k-space t ...
Institute of Electrical and Electronics Engineers2011
We present a model where we integrate schedule design, fleet assignment and demand models to maximize the profit of an airline. The objective of the study is to identify the challenges behind the integration of demand modeling into the optimization model a ...
The polynomial Hirsch conjecture states that the vertex-edge diameter of a d-dimensional polyhedron with n facets is bounded by a polynomial in d and n. For the special case where the polyhedron is defined as the set of points satisfying a system Ax ≤ b of ...
Bearing estimation algorithms obtain only a small number of direction of arrivals (DOAs) within the entire angle domain, when the sources are spatially sparse. Hence, we propose a method to specifically exploit this spatial sparsity property. The method us ...
Institute of Electrical and Electronics Engineers2012
Receding horizon control requires the solution of an optimization problem at every sampling instant. We present efficient interior point methods tailored to convex multistage problems, a problem class which most relevant MPC problems with linear dynamics c ...
The purpose of software partitioning is to assign code segments of a given computer program to a range of execution locations such as general-purpose processors or specialist hardware components. These execution locations differ in speed, communication cha ...
Receding horizon control requires the solution of an optimization problem at every sampling instant. We present efficient interior point methods tailored to convex multistage problems, a problem class which most relevant MPC problems with linear dynamics c ...