| Publication | Date of Publication | Type |
|---|
| A branch-and-bound approach for a vehicle routing problem with customer costs | 2023-07-12 | Paper |
| An introduction to stochastic bin packing-based server consolidation with conflicts | 2022-06-16 | Paper |
| Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles | 2021-07-27 | Paper |
| A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem | 2020-06-29 | Paper |
| An improved flow-based formulation and reduction principles for the minimum connectivity inference problem | 2019-10-02 | Paper |
| Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation | 2019-07-02 | Paper |
| Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case | 2019-03-06 | Paper |
| Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory | 2019-01-14 | Paper |
| An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case | 2018-10-09 | Paper |
| The skiving stock problem and its relation to hypergraph matchings | 2018-08-20 | Paper |
| A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems | 2018-05-30 | Paper |
| Integer rounding and modified integer rounding for the skiving stock problem | 2018-05-24 | Paper |
| Cutting and Packing Problems with Placement Constraints | 2018-04-13 | Paper |
| Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods | 2018-03-26 | Paper |
| LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap | 2017-12-01 | Paper |
| On the Solution of Generalized Spectrum Allocation Problems | 2017-12-01 | Paper |
| Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem | 2017-12-01 | Paper |
| Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem | 2017-12-01 | Paper |
| Creating Worst-Case Instances for Lower Bounds of the 2D Strip Packing Problem | 2017-12-01 | Paper |
| An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case | 2017-07-27 | Paper |
| The proper relaxation and the proper gap of the skiving stock problem | 2017-02-10 | Paper |
| Packing unequal spheres into various containers | 2016-11-01 | Paper |
| Integer linear programming models for the skiving stock problem | 2016-10-07 | Paper |
| On the global minimum in a balanced circular packing problem | 2016-09-21 | Paper |
| Upper Bounds for Heuristic Approaches to the Strip Packing Problem | 2016-05-19 | Paper |
| New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem | 2016-05-19 | Paper |
| Upper bounds for heuristic approaches to the strip packing problem | 2016-05-04 | Paper |
| Minimal proper non-IRUP instances of the one-dimensional cutting stock problem | 2015-06-10 | Paper |
| Relations between capacity utilization, minimal bin size and bin number | 2015-01-22 | Paper |
| LP bounds in various constraint programming approaches for orthogonal packing | 2012-11-15 | Paper |
| Setup and open-stacks minimization in one-dimensional stock cutting | 2012-06-18 | Paper |
| Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution | 2012-02-29 | Paper |
| Cutting and packing optimization. Problems modeling and solution methods. | 2008-07-07 | Paper |
| Mathematical modeling of interactions of primary geometric 3D objects | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828033 | 2004-11-24 | Paper |
| \(\Phi\)-functions for complex 2D-objects | 2004-09-22 | Paper |
| Families of non-IRUP instances of the one-dimensional cutting stock problem | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712306 | 2002-04-16 | Paper |
| Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem | 2002-01-01 | Paper |
| 4-block heuristic for the rectangle packing problem | 2001-10-21 | Paper |
| An efficient approach for the multi-pallet loading problem | 2000-07-09 | Paper |
| Tighter relaxations for the cutting stock problem | 1999-11-08 | Paper |
| The modified integer round-up property of the one-dimensional cutting stock problem | 1999-08-25 | Paper |
| New cases of the cutting stock problem having MIRUP | 1999-08-22 | Paper |
| The solution of two-stage guillotine cutting stock problems having extremely varying order demands | 1999-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4233346 | 1999-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398379 | 1998-07-19 | Paper |
| Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem | 1997-12-17 | Paper |
| The G4-Heuristic for the Pallet Loading Problem | 1997-06-22 | Paper |
| The solution of packing problems with pieces variable length and additional allocation constraints | 1996-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848284 | 1996-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858956 | 1995-12-20 | Paper |
| A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem | 1995-11-09 | Paper |
| Modeling of packing problems | 1995-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4034195 | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3989344 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3980375 | 1992-06-26 | Paper |
| A note on handling residual lengths | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3492274 | 1990-01-01 | Paper |
| On the stochastic complexity of the asymmetric traveling salesman problem | 1989-01-01 | Paper |
| Guillotine cutting of defective boards | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3806276 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3805803 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3775350 | 1987-01-01 | Paper |
| Complexity investigations on the ellipsoid algorithm | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3745624 | 1986-01-01 | Paper |
| On recursive computation of minimum spanning trees for special partial graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741632 | 1985-01-01 | Paper |
| A new extension principle algorithm for the traveling salesman problem | 1982-01-01 | Paper |
