126 search results - page 1 / 26 » Surrogate constraint normalization for the set covering prob... |
EOR
2010
13 years 5 months ago
2010
EOR
2008
13 years 5 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
AAIM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
TASE
2010
IEEE
13 years 20 min ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...