Search
Now showing items 1-3 of 3
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 ...
The attractive traveling salesman problem
(Elsevier, 2010-05-16)
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of the facility vertices. Profit is computed ...
A branch-and-cut algorithm for solving the non-preemptive capacitated swapping problem
(Elsevier, 2010-08-06)
This paper models and solves a capacitated version of the Non-Preemptive Swapping Problem. This problem is defined on a complete digraph , at every vertex of which there may be one unit of supply of an item, one unit of ...
Share this page