895 search results - page 36 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
108
click to vote
ICRA
2005
IEEE
15 years 8 months ago
2005
IEEE
— In this paper we address the problem of generating a motion strategy to find an object in a known 3-D environment as quickly as possible on average. We use a sampling scheme t...
165
click to vote
ICNC
2009
Springer
15 years 7 months ago
2009
Springer
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
138
click to vote
TEC
2010
14 years 10 months ago
2010
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...
114
click to vote
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
141
click to vote
ALGORITHMICA
2008
15 years 3 months ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion