Sciweavers

162 search results - page 1 / 33
» On Guillotine Cutting Sequences
Sort
View
COR
2010
123views more  COR 2010»
13 years 5 months ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
Rasmus Resen Amossen, David Pisinger
EVOW
2004
Springer
13 years 10 months ago
Solving a Real-World Glass Cutting Problem
We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, ...
Jakob Puchinger, Günther R. Raidl, Gabriele K...
COCOON
2008
Springer
13 years 6 months ago
Polychromatic Colorings of n-Dimensional Guillotine-Partitions
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...
Balázs Keszegh
HCI
2009
13 years 2 months ago
Interactive Object Segmentation System from a Video Sequence
In this paper, we present an interactive object segmentation system form video, such as TV products and films, for converting 2D to 3D contents. It is focused on reducing the proce...
Guntae Bae, Soo Yeong Kwak, Hyeran Byun
JOTA
2011
149views more  JOTA 2011»
12 years 12 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...