16404 search results - page 454 / 3281 » A set coverage problem |
170
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...
165
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
191
click to vote
EWCBR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Being able to predict the performance of a Case-Based Reasoning(CBR) system against a set of future problems would provide invaluable information for design and maintenan...
190
click to vote
CATS
2008
15 years 8 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
210
click to vote
NIPS
2004
15 years 8 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...