236 search results - page 11 / 48 » On the Vehicle Routing Problem with lower bound capacities |
209
click to vote
COMGEO
2012
ACM
14 years 1 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
146
click to vote
EOR
2007
15 years 6 months ago
2007
In this study we focus on the integration of inventory control and vehicle routing schedules for a distribution system in which the warehouse is responsible for the replenishment ...
177
click to vote
TIT
2011
15 years 29 days ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
129
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— Cable robots have seen considerable recent interest ensuing from their ability to combine a large workspace with significant payload capacity. However, the cables can apply for...
180
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...