Sciweavers

1542 search results - page 14 / 309
» Kernelization of packing problems
Sort
View
COR
2008
105views more  COR 2008»
13 years 7 months ago
Minimizing the object dimensions in circle and sphere packing problems
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, ...
Ernesto G. Birgin, F. N. C. Sobral
EOR
2007
87views more  EOR 2007»
13 years 7 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...
4OR
2008
115views more  4OR 2008»
13 years 6 months ago
A branch-and-price algorithm for the two-dimensional level strip packing problem
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
Andrea Bettinelli, Alberto Ceselli, Giovanni Righi...
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
14 years 2 months ago
A hybrid genetic algorithm for a variant of two-dimensional packing problem
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
Jin Kim, Byung Ro Moon
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 9 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan