Browsing by Subject "Combinatorial optimization."
Now showing items 1-2 of 2
-
Constrained shortest paths for QoS routing and path protection in communication networks.
(2005)The CSDP (k) problem requires the selection of a set of k > 1 link-disjoint paths with minimum total cost and with total delay bounded by a given upper bound. This problem arises in the context of provisioning paths in a ... -
A mean-variance model for stochastic time-dependent networks.
(2005)Traditional models of route generation are based on choosing routes that minimize expected travel-time between origin and destination. The variance of the least-time path is not included in the path selection. In addition, ...