Sciweavers

144 search results - page 4 / 29
» New approaches to covering and packing problems
Sort
View
EOR
2007
104views more  EOR 2007»
14 years 9 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
EOR
2007
97views more  EOR 2007»
14 years 9 months ago
Using pattern matching for tiling and packing problems
act 12 This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be 13 considered as a special case of bin packing. In the pr...
Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fat...
AIPS
2006
14 years 11 months ago
Optimal Rectangle Packing: A Meta-CSP Approach
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
Michael D. Moffitt, Martha E. Pollack
75
Voted
COR
2008
105views more  COR 2008»
14 years 9 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»
14 years 9 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...