16404 search results - page 397 / 3281 » A set coverage problem |
206
click to vote
HEURISTICS
2010
15 years 3 months ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
140
click to vote
TSMC
2008
15 years 6 months ago
2008
In most real-world problems, we either know little about the problems or the problems are too complex to have a clear vision on how to decompose them by hand. Thus, it is usually d...
143
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
154
click to vote
APPROX
2007
Springer
16 years 14 days ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
169
Voted
SAT
2007
Springer
16 years 11 days ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...