31 search results - page 3 / 7 » The Finite Capacity Dial-A-Ride Problem |
EUROPAR
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evalu...
NETWORKS
2006
13 years 6 months ago
2006
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
MP
1998
13 years 6 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
NETWORKS
2006
13 years 6 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
ECCV
2004
Springer
14 years 8 months ago
2004
Springer
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...