144 search results - page 5 / 29 » New approaches to covering and packing problems |
182
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
KI
2007
Springer
15 years 3 months ago
2007
Springer
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
112
click to vote
WEA
2010
Springer
15 years 2 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...