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 ...
Two classes of quadratic assignment problems that are solvable as linear assignment problems
(Elsevier, 2011-08)
The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment ...
Share this page