## Search

Now showing items 1-5 of 5

#### A stochastic optimization model for designing last Mile relief networks

(Informs, 2016-08)

In this study, we introduce a distribution network design problem that determines the locations and capacities of the relief distribution points in the last mile network, while considering demand- and network-related ...

#### 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 ...

#### An exact algorithm for the Steiner tree problem with delays

(Elsevier, 2010-08-01)

The Steiner Tree Problem with Delays (STPD) is a variant of the well-known Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a ...

#### 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