1542 search results - page 9 / 309 » Kernelization of packing problems |
ANOR
2010
13 years 7 months ago
2010
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
SWAT
2010
Springer
13 years 5 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
CP
2003
Springer
14 years 23 days ago
2003
Springer
We propose a two-level search strategy to solve a two dimensional circle packing problem. At the first level, a good enough packing algorithm called
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G = (V, E) and k commodities, each corresponding to a set of terminal...
STOC
2005
ACM
14 years 1 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...