16404 search results - page 360 / 3281 » A set coverage problem |
148
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...
126
click to vote
COR
2008
15 years 5 months ago
2008
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
159
Voted
COR
2007
15 years 5 months ago
2007
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
151
Voted
MLQ
2007
15 years 4 months ago
2007
We examine the concept of almost everywhere domination from the viewpoint of mass problems. Let AED and MLR be the set of reals which are almost everywhere dominating and Martin-L...
135
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct co...