22 search results - page 3 / 5 » Asymmetric Traveling Salesman Path and Directed Latency Prob... |
FOCS
2003
IEEE
14 years 27 days ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
COR
2008
13 years 6 months ago
2008
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
ICUMT
2009
13 years 5 months ago
2009
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
MDM
2009
Springer
14 years 2 months ago
2009
Springer
While wireless sensor networks (WSNs) are typically targeted at large-scale deployment, due to many practical or inevitable reasons, a WSN may not always remain connected. In this...
AI
2006
Springer
13 years 7 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...