Sciweavers

Share
6 search results - page 1 / 2
» An improved typology of cutting and packing problems
Sort
View
EOR
2007
110views more  EOR 2007»
10 years 4 months ago
An improved typology of cutting and packing problems
Gerhard Wäscher, Heike Haußner, Holger ...
CORR
2004
Springer
113views Education» more  CORR 2004»
10 years 4 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
EOR
2007
104views more  EOR 2007»
10 years 4 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
ICPR
2008
IEEE
11 years 5 months ago
Tailoring text for automatic layouting of newspaper pages
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...
Leonhard Hennig, Thomas Strecker
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
10 years 8 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
books