Inventory routing problems aim at minimizing the cost of the total distance traveled over a time horizon discretized in periods, while guaranteeing that th...

Given a directed graph with weights on the vertices and on the arcs, a &theta;-improper <i>k</i>-coloring is an assignment of at most <i>k</i> different colo...

Given a graph <i>G</i>, an integer <i>k</i>, and a cost <i>c_uv</i> associated with all pairs <i>uv</i> of non-adjacent vertices in <i>G</i>, the ...

In this paper we study a variant of the Capacitated Team Orienteering Problem (CTOP), that is the problem where a fleet of vehicles, each with a constraint...

In this paper we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated w...

In this paper, we study the split delivery vehicle routing problem with time windows SDVRPTW that is a variant of the well-known vehicle routing problem with...

We consider an inventory routing problem in discrete time where a supplier has to serve a set of customers over a time horizon. A capacity constraint for th...

A profit and a demand are associated with each arc of a set of profitable arcs of a given graph. A travel time is associated with each arc of the graph. A fl...

In this paper we study the Capacitated Team Orienteering and Profitable Tour Problems (CTOP and CPTP). The interest in these problems comes from recent devel...

The Team Orienteering Problem (TOP) is the generalization to the case of mul- tiple tours of the Orienteering Problem, known also as Selective Traveling Sal...

We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbour solution is obtained by removing a ...