Related papers: Approximation algorithms for the Transportation Pr…
In several multiobjective decision problems Pairwise Comparison Matrices (PCM) are applied to evaluate the decision variants. The problem that arises very often is the inconsistency of a given PCM. In such a situation it is important to…
In this paper, we give the first constant approximation algorithm for the lower bounded facility location (LBFL) problem with general lower bounds. Prior to our work, such algorithms were only known for the special case where all facilities…
This paper studies a combinatorial optimization problem which is obtained by combining the flow shop scheduling problem and the shortest path problem. The objective of the obtained problem is to select a subset of jobs that constitutes a…
This paper investigates the social optimum for a dynamic linear quadratic collective choice problem where a group of agents choose among multiple alternatives or destinations. The agents' common objective is to minimize the average cost of…
In this paper, we investigate the Mechanism Design aspects of the $m$-Capacitated Facility Location Problem ($m$-CFLP) on a line. We focus on two frameworks. In the first framework, the number of facilities is arbitrary, all facilities have…
The aim of the paper is to compare different approximation algorithms for the travelling salesperson problem. We pick the most popular and widespread methods known in the literature and contrast them with a novel approach (the polygonal…
Recent developments in modular transport vehicles allow deploying multi-purpose vehicles which can alternately transport different kinds of flows. In this study, we propose a novel variant of the pickup and delivery problem, the…
We consider the one-to-one Pickup and Delivery Problem (PDP) in Euclidean Space with arbitrary dimension $d$ where $n$ transportation requests are picked i.i.d. with a separate origin-destination pair for each object to be moved. First, we…
This article generalizes the study of branched/ramified optimal transportation to those with capacity constraints. Each admissible transport network studied here is represented by a transport multi-path between measures, with a capacity…
The growing popularity of bike-sharing systems around the world has motivated recent attention to models and algorithms for their effective operation. Most of this literature focuses on their daily operation for managing asymmetric demand.…
The $k$-Facility Location problem is a generalization of the classical problems $k$-Median and Facility Location. The goal is to select a subset of at most $k$ facilities that minimizes the total cost of opened facilities and established…
Our paper approaches the parking assistance service in urban environments as an instance of service provision in non-cooperative network environments. We propose normative abstractions for the way drivers pursue parking space and the way…
In this invited contribution, we revisit the stochastic shortest path problem, and show how recent results allow one to improve over the classical solutions: we present algorithms to synthesize strategies with multiple guarantees on the…
The advances in information and communication technology are changing theway people move. Companies that offer demand-responsive transportation serviceshave the opportunity to reduce their costs and increase their revenues…
We revisit the discrete heterogeneous two-facility location problem, in which there is a set of agents that occupy nodes of a line graph, and have private approval preferences over two facilities. When the facilities are located at some…
We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting.…
Traffic congestion has become an inevitable challenge in large cities due to population increases and expansion of urban areas. Various approaches are introduced to mitigate traffic issues, encompassing from expanding the road…
This paper presents a matching mechanism for assigning drivers to routes where the drivers pay a toll for the marginal delay they impose on other drivers. The simple matching mechanism is derived from the RANKING algorithm for online…
The paper addresses the Vehicle Relocation Problem in free-floating car-sharing services by presenting a solution focused on strategies for repositioning vehicles and transferring personnel with the use of scooters. Our method begins by…
Consider a storage area where arriving items are stored temporarily in bounded capacity stacks until their departure. We look into the problem of deciding where to put an arriving item with the objective of minimizing the maximum number of…