1054 search results - page 55 / 211 » Capacitated Domination Problem |
111
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
141
Voted
NETWORKS
2008
15 years 2 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
142
Voted
NETWORKS
2006
15 years 2 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...
144
click to vote
ALGORITHMICA
2006
15 years 2 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
127
Voted
TEI
2012
ACM
13 years 10 months ago
2012
ACM
Graspable tangibles are now being explored on the current generation of capacitive touch surfaces, such as the iPad and the Android tablet. Because the size and form factor is rel...