1 citations · 1 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2006★ 1 cited
An exact algorithm for higher-dimensional orthogonal packing
Sandor P. Fekete, Joerg Schepers, Jan C. van der Veen
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for…
cs.DS2004
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Sandor P. Fekete, Joerg Schepers
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…
cs.DS2003
A combinatorial characterization of higher-dimensional orthogonal packing
Sandor P. Fekete, Joerg Schepers
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have b…