2536 search results - page 80 / 508 » Constructing Optimal Highways |
OR
2004
Springer
15 years 5 months ago
2004
Springer
This contribution addresses the consideration of time windows in the optimization of multi-commodity network flows. For each node, one interval is specified in which the visitati...
FGCS
2000
14 years 11 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
182
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
requirement. Furthermore, programming using sequence constructs normally produce nested structures and The current approachfor modeling synchronization in scattered code, especiall...
124
click to vote
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
JOIN
2007
14 years 11 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...