| Publication | Date of Publication | Type |
|---|
Families of non-IRUP instances of the one-dimensional cutting stock problem
Discrete Applied Mathematics | 2002-08-29 | Paper |
Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
Optimization | 2002-01-01 | Paper |
An efficient approach for the multi-pallet loading problem
European Journal of Operational Research | 2000-07-09 | Paper |
Tighter relaxations for the cutting stock problem
European Journal of Operational Research | 1999-11-08 | Paper |
The modified integer round-up property of the one-dimensional cutting stock problem
European Journal of Operational Research | 1999-08-25 | Paper |
New cases of the cutting stock problem having MIRUP
Mathematical Methods of Operations Research | 1999-08-22 | Paper |
The solution of two-stage guillotine cutting stock problems having extremely varying order demands
European Journal of Operational Research | 1999-04-27 | Paper |
| scientific article; zbMATH DE number 1175962 (Why is no real title available?) | 1998-07-19 | Paper |
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
Operations Research Letters | 1997-12-17 | Paper |
| scientific article; zbMATH DE number 1084496 (Why is no real title available?) | 1997-11-10 | Paper |
The G4-Heuristic for the Pallet Loading Problem
The Journal of the Operational Research Society | 1997-06-22 | Paper |
| scientific article; zbMATH DE number 797002 (Why is no real title available?) | 1996-02-18 | Paper |
A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
INFOR: Information Systems and Operational Research | 1995-11-09 | Paper |
Modeling of packing problems
Optimization | 1995-04-20 | Paper |
| scientific article; zbMATH DE number 598463 (Why is no real title available?) | 1994-06-30 | Paper |
| scientific article; zbMATH DE number 34437 (Why is no real title available?) | 1992-06-28 | Paper |
On the stochastic complexity of the asymmetric traveling salesman problem
European Journal of Operational Research | 1989-01-01 | Paper |
Guillotine cutting of defective boards
Optimization | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4075941 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4074379 (Why is no real title available?) | 1987-01-01 | Paper |
Complexity investigations on the ellipsoid algorithm
Optimization | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3980922 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3821426 (Why is no real title available?) | 1983-01-01 | Paper |
A new extension principle algorithm for the traveling salesman problem
Mathematische Operationsforschung und Statistik. Series Optimization | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3795681 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3763671 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3702391 (Why is no real title available?) | 1980-01-01 | Paper |
Ein beitrag zur klassifizierung von rundreiseproblemen
Mathematische Operationsforschung und Statistik. Series Optimization | 1979-01-01 | Paper |
The nicholson principle in discrete dynamic optimization
Mathematische Operationsforschung und Statistik. Series Optimization | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3609458 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3641195 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3591724 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3499168 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3456661 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3423814 (Why is no real title available?) | 1973-01-01 | Paper |
Algorithmen für das klassische maschinenbelegungsproblem
Mathematische Operationsforschung Statistik | 1972-01-01 | Paper |
