Search
Now showing items 1-2 of 2
Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
(Informs, 2011-08)
The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total ...
Scheduling ambulance crews for maximum coverage
(Palgrave MacMillan, 2010-04)
This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with ...
Share this page