AbstractWe present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then utilized in a design of best-to-date approximation algorithms
An approximation algorithm for an optimization problem runs in polynomial time for all instances and...
Given $n$ identical objects (pegs), placed at arbitrary initial locations, we consider the problem o...
This paper considers the classical vehicle routing problem (VRP) where the vehicle capacity is not f...
AbstractWe present lower bounds for the vehicle routing problem (VRP) with and without split deliver...
AbstractIn this paper we review the exact algorithms based on the branch and bound approach proposed...
AbstractThis paper considers a relaxation of the classical vehicle routing problem (VRP), in which s...
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on th...
In the vehicle routing problem (VRP) the objective is to construct a minimum cost set of routes serv...
The Capacitated Vehicle Routing Problem (CVRP) is a classic combinatorial optimization problem for w...
We consider the vehicle routing problem with stochastic demands (VRPSD). We give randomized approxim...
The Vehicle Routing Problem (VRP) is a hard and very well-known combinatorial optimization problem ...
Given a set of clients with demands, the Capacitated Vehicle Routing problem is to find a set of tou...
The Vehicle Routing Problem (VRP) is a generalization of the Traveling Salesman Problem (TSP) and is...
Cataloged from PDF version of article.Thesis (Ph.D): Bilkent University, Department of Industrial En...
We consider the vehicle routing problem where one can choose among vehicles with different costs and...
An approximation algorithm for an optimization problem runs in polynomial time for all instances and...
Given $n$ identical objects (pegs), placed at arbitrary initial locations, we consider the problem o...
This paper considers the classical vehicle routing problem (VRP) where the vehicle capacity is not f...
AbstractWe present lower bounds for the vehicle routing problem (VRP) with and without split deliver...
AbstractIn this paper we review the exact algorithms based on the branch and bound approach proposed...
AbstractThis paper considers a relaxation of the classical vehicle routing problem (VRP), in which s...
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on th...
In the vehicle routing problem (VRP) the objective is to construct a minimum cost set of routes serv...
The Capacitated Vehicle Routing Problem (CVRP) is a classic combinatorial optimization problem for w...
We consider the vehicle routing problem with stochastic demands (VRPSD). We give randomized approxim...
The Vehicle Routing Problem (VRP) is a hard and very well-known combinatorial optimization problem ...
Given a set of clients with demands, the Capacitated Vehicle Routing problem is to find a set of tou...
The Vehicle Routing Problem (VRP) is a generalization of the Traveling Salesman Problem (TSP) and is...
Cataloged from PDF version of article.Thesis (Ph.D): Bilkent University, Department of Industrial En...
We consider the vehicle routing problem where one can choose among vehicles with different costs and...
An approximation algorithm for an optimization problem runs in polynomial time for all instances and...
Given $n$ identical objects (pegs), placed at arbitrary initial locations, we consider the problem o...
This paper considers the classical vehicle routing problem (VRP) where the vehicle capacity is not f...
DOI
Add to ORKG