| Publication | Date of Publication | Type |
|---|
LP-based bounds for the container and multi-container loading problem
International Transactions in Operational Research | 2026-02-25 | Paper |
A branch-and-bound approach for a vehicle routing problem with customer costs
EURO Journal on Computational Optimization | 2023-07-12 | Paper |
An introduction to stochastic bin packing-based server consolidation with conflicts
Top | 2022-06-16 | Paper |
Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles
Discrete Optimization | 2021-07-27 | Paper |
A computational study of reduction techniques for the minimum connectivity inference problem
Advances in Mechanics and Mathematics | 2020-06-29 | Paper |
An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
Optimization | 2019-10-02 | Paper |
Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
4OR | 2019-07-02 | Paper |
Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
Annals of Operations Research | 2019-03-06 | Paper |
Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
Optimization | 2019-01-14 | Paper |
An improved upper bound for the gap of skiving stock instances of the divisible case
Operations Research Proceedings | 2018-10-09 | Paper |
The skiving stock problem and its relation to hypergraph matchings
Discrete Optimization | 2018-08-20 | Paper |
A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
European Journal of Operational Research | 2018-05-30 | Paper |
Integer rounding and modified integer rounding for the skiving stock problem
Discrete Optimization | 2018-05-24 | Paper |
Cutting and packing problems with placement constraints
Optimized Packings with Applications | 2018-04-13 | Paper |
Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
International Series in Operations Research & Management Science | 2018-03-26 | Paper |
LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
Operations Research Proceedings | 2017-12-01 | Paper |
On the solution of generalized spectrum allocation problems
Operations Research Proceedings 2016 | 2017-12-01 | Paper |
Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem
Operations Research Proceedings | 2017-12-01 | Paper |
Creating worst-case instances for upper and lower bounds of the two-dimensional strip packing problem
Operations Research Proceedings | 2017-12-01 | Paper |
Creating worst-case instances for lower bounds of the 2D strip packing problem
Operations Research Proceedings 2016 | 2017-12-01 | Paper |
An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
Discrete Applied Mathematics | 2017-07-27 | Paper |
The proper relaxation and the proper gap of the skiving stock problem
Mathematical Methods of Operations Research | 2017-02-10 | Paper |
Packing unequal spheres into various containers
Cybernetics and Systems Analysis | 2016-11-01 | Paper |
Integer linear programming models for the skiving stock problem
European Journal of Operational Research | 2016-10-07 | Paper |
On the global minimum in a balanced circular packing problem
Optimization Letters | 2016-09-21 | Paper |
Upper bounds for heuristic approaches to the strip packing problem
Operations Research Proceedings | 2016-05-19 | Paper |
New inequalities for 1D relaxations of the 2D rectangular strip packing problem
Operations Research Proceedings | 2016-05-19 | Paper |
Upper bounds for heuristic approaches to the strip packing problem
International Transactions in Operational Research | 2016-05-04 | Paper |
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
Discrete Applied Mathematics | 2015-06-10 | Paper |
Relations between capacity utilization, minimal bin size and bin number
Annals of Operations Research | 2015-01-22 | Paper |
LP bounds in various constraint programming approaches for orthogonal packing
Computers & Operations Research | 2012-11-15 | Paper |
Setup and open-stacks minimization in one-dimensional stock cutting
INFORMS Journal on Computing | 2012-06-18 | Paper |
Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution
Automation and Remote Control | 2012-02-29 | Paper |
Cutting and packing optimization. Problems modeling and solution methods.
Studienbücher Wirtschaftsmathematik | 2008-07-07 | Paper |
Mathematical modeling of interactions of primary geometric 3D objects
Cybernetics and Systems Analysis | 2006-10-20 | Paper |
| scientific article; zbMATH DE number 2118585 (Why is no real title available?) | 2004-11-24 | Paper |
\(\Phi\)-functions for complex 2D-objects
4OR | 2004-09-22 | Paper |
Families of non-IRUP instances of the one-dimensional cutting stock problem
Discrete Applied Mathematics | 2002-08-29 | Paper |
| scientific article; zbMATH DE number 1594516 (Why is no real title available?) | 2002-04-16 | Paper |
Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
Optimization | 2002-01-01 | Paper |
4-block heuristic for the rectangle packing problem
European Journal of Operational Research | 2001-10-21 | 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 1264414 (Why is no real title available?) | 1999-03-16 | 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 |
The G4-Heuristic for the Pallet Loading Problem
The Journal of the Operational Research Society | 1997-06-22 | Paper |
The solution of packing problems with pieces variable length and additional allocation constraints
Optimization | 1996-07-28 | Paper |
| scientific article; zbMATH DE number 797002 (Why is no real title available?) | 1996-02-18 | Paper |
| scientific article; zbMATH DE number 827989 (Why is no real title available?) | 1995-12-20 | 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 166938 (Why is no real title available?) | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 34437 (Why is no real title available?) | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 21364 (Why is no real title available?) | 1992-06-26 | Paper |
A note on handling residual lengths
Optimization | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4165901 (Why is no real title available?) | 1990-01-01 | 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 |
| scientific article; zbMATH DE number 4035602 (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 |
On recursive computation of minimum spanning trees for special partial graphs
Optimization | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3974972 (Why is no real title available?) | 1985-01-01 | Paper |
A new extension principle algorithm for the traveling salesman problem
Mathematische Operationsforschung und Statistik. Series Optimization | 1982-01-01 | Paper |
