Publications associées à Approximation algorithms for regret minimization in vehicle routing 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.

Optimal Software Patching Plan for PMUs

Jean-Yves Le Boudec, Ola Nils Anders Svensson, Teklemariam Tsegay Tesfay

Phasor measurement units (PMUs) deployed to monitor the state of an electrical grid need to be patched from time to time to prevent attacks that exploit vulnerabilities in the software. Applying some of these patches requires a PMU reboot, which takes the ...

2017

A unified framework for rich routing problems with stochastic demands

Michel Bierlaire, Sacha Varone, Mohammad Yousef Maknoon, Iliya Dimitrov Markov

We introduce a unified framework for rich vehicle and inventory routing problems with complex physical and temporal constraints. Demands are stochastic, can be non-stationary, and are forecast using any model that provides the expected demands and their er ...

2017

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

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

EPFL2016

Submodular Stochastic Probing on Matroids

Justin Dean Ward, Marek Adamczyk

In a stochastic probing problem we are given a universe E, and a probability that each element e in E is active. We determine if an element is active by probing it, and whenever a probed element is active, we must permanently include it in our solution. Mo ...

INFORMS2016

Vehicle routing with cross-dock selection

Mohammad Yousef Maknoon

The vehicle routing problem with cross-dock selection is a variant of the vehicle routing problem containing spatial and load synchronization constraints by which products are transferred and processed via at least one cross-dock. This paper presents a mat ...

Pergamon-Elsevier Science Ltd2016

Improving Christofides' Algorithm for the s-t Path TSP

Hyung Chan An

We present a deterministic (1+root 5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the t ...

Assoc Computing Machinery2015

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Approximating ATSP by Relaxing Connectivity

Ola Nils Anders Svensson

The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs. Our arguments a ...

IEEE Computer Society2015

Approximation algorithms for regret minimization in vehicle routing problems

Graph Chatbot

Chattez avec Graph Search

Optimal Software Patching Plan for PMUs

A unified framework for rich routing problems with stochastic demands

Approximation algorithms for geometric dispersion

A New Framework for Distributed Submodular Maximization

Submodular Stochastic Probing on Matroids

Vehicle routing with cross-dock selection

Improving Christofides' Algorithm for the s-t Path TSP

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Centrality of trees for capacitated -center

Approximating ATSP by Relaxing Connectivity

Approximation algorithms for geometric dispersion

Optimal Software Patching Plan for PMUs

Improving Christofides' Algorithm for the s-t Path TSP

A unified framework for rich routing problems with stochastic demands

Submodular Stochastic Probing on Matroids

Vehicle routing with cross-dock selection

A New Framework for Distributed Submodular Maximization

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Approximating ATSP by Relaxing Connectivity

Centrality of trees for capacitated -center