Scheithauer Guntram

Guntram Scheithauer

Information about the author Guntram Scheithauer will soon be added to the site.
Found 12 papers in total
Upper bounds for heuristic approaches to the strip packing problem
Upper bounds for heuristic approaches to the strip packing problem
2016
We consider the 2D and 3D strip packing problem (SPP): given a set of rectangular...
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
2007
The primary objective in cutting and packing problems is trim loss or material input...
An efficient approach for the multi-pallet loading problem
An efficient approach for the multi-pallet loading problem
2000
The distributor's or multi-pallet loading problem is considered in this paper. This...
LP-based bounds for the container and multi-container loading problem
LP-based bounds for the container and multi-container loading problem
1999
New relaxations are developed in this paper for problems of optimal packing of small...
Tighter relaxations for the cutting stock problem
Tighter relaxations for the cutting stock problem
1999
In the cutting stock problem (CSP) a given order for smaller pieces has to be cut from...
Equivalence and dominance for problems of optimal packing of rectangles
Equivalence and dominance for problems of optimal packing of rectangles
1997
In this paper we consider the problem of optimal packing of small rectangles within a...
4-Block heuristic for the rectangle packing problem
4-Block heuristic for the rectangle packing problem
1998
In this paper the rectangle packing problem (RPP) is considered. The RPP consists in...
The solution of two-stage guillotine cutting stock problems having extremely varying order demands
The solution of two-stage guillotine cutting stock problems having extremely varying order demands
1996
In this paper the solution of two-stage guillotine cutting stock problems is...
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
1997
Many numerical computations show a small difference only between the optimal value of...
The modified integer round-up property of the one-dimensional cutting stock problem
The modified integer round-up property of the one-dimensional cutting stock problem
1995
A linear integer minimization problem (IP) has the modified integer round-up property...
The G4-heuristic for the pallet loading problem
The G4-heuristic for the pallet loading problem
1996
A new heuristic for the well-known (two-dimensional orthogonal) pallet loading problem...
On the stochastic complexity of the asymmetric traveling salesman problem
On the stochastic complexity of the asymmetric traveling salesman problem
1989
Based on the assignment problem relaxation, an approach is proposed for the stochastic...
Papers per page: