Publication

A column generation algorithm for the vehicle routing problem with soft time windows

Related publications (58)

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.

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Time- and Space-Efficient Sliding Window Top-k Query Processing

Karl Aberer, Kresimir Pripuzic

A sliding window top-k (top-k/w) query monitors incoming data stream objects within a sliding window of size w to identify the k highest-ranked objects with respect to a given scoring function over time. Processing of such queries is challenging because, e ...

Association for Computing Machinery2015

Sampling Curves with Finite Rate of Innovation

Thierry Blu, Hanjie Pan, Pier Luigi Dragotti

In this paper, we extend the theory of sampling signals with finite rate of innovation (FRI) to a specific class of two-dimensional curves, which are defined implicitly as the zeros of a mask function. Here the mask function has a parametric representation ...

Institute of Electrical and Electronics Engineers2014

Constrained Reachability and Trajectory Generation for Flat Systems

Timm Faulwasser

We consider the problem of trajectory generation for constrained differentially flat systems. Based on the topological properties of the set of admissible steady state values of a flat output we derive conditions which allow for an a priori verification of ...

Pergamon-Elsevier Science Ltd2014

Approximation algorithms for regret minimization in vehicle routing problems

Adrian Aloysius Bock

In this thesis, we present new approximation algorithms as well as hardness of approximation results for NP-hard vehicle routing problems related to public transportation. We consider two different problem classes that also occur frequently in areas such a ...

EPFL2014

Constrained Binary Identification Problem

Amin Karbasi, Morteza Zadimoghaddam

We consider the problem of building a binary decision tree, to locate an object within a set by way of the least number of membership queries. This problem is equivalent to the “20 questions game” of information theory and is closely related to lossless so ...

2013

Mirror Match: Reliable Feature Point Matching Without Geometric Constraints

Sabine Süsstrunk, Stefan Winkler

Many algorithms have been proposed to solve the problem of matching feature points in two or more images using geometric assumptions to increase the robustness of the matching. However, these assumptions do not always hold; in particular, few methods addre ...

2013

Modeling an America's Cup Regatta as a Sequential Stochastic Game

Jean-Benoît Rossel

The main objective of this thesis is to model a regatta in the America’s Cup, and more precisely the first leg of the race, where the two competing sailboats have to move upwind. During the race, each crew attempts to be the first to reach the end of this ...

EPFL2013

The School Bus Problem on Trees

Laura Sanità, Adrian Aloysius Bock

The School Bus Problem is an NP-hard vehicle routing problem in which the goal is to route buses that transport children to a school such that for each child, the distance travelled on the bus does not exceed the shortest distance from the child's home to ...

Springer US2013

A new formulation of the two-dimensional cutting-stock problem with consideration of demand planning

Naoufel Cheikhrouhou, Omar Ayadi

This paper focuses on the two dimensional rectangular non-oriented guillotine cutting stock problem (TDRCSP) in which many pieces with different dimensions need to be cut with different quantities in order to satisfy customers' orders. In order to maximise ...

2012