| Publication | Date of Publication | Type |
|---|
Correction to: ``The overflowing bin packing problem: theoretical results and compact ILP formulations''
Mathematical Methods of Operations Research | 2026-08-13 | Paper |
Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing
4OR | 2026-06-12 | Paper |
Extending the reflect flow formulation to variable-sized one-dimensional cutting and skiving stock problems
European Journal of Operational Research | 2026-06-09 | Paper |
Bin packing with thresholds: mathematical models and theoretical results
European Journal of Operational Research | 2026-04-27 | Paper |
| A heuristic column generation approach for the stochastic bin packing problem | 2024-09-17 | Paper |
| A heuristic-based reduction for the temporal bin packing problem with fire-ups | 2024-09-17 | Paper |
Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
Annals of Operations Research | 2024-04-24 | Paper |
A combinatorial flow-based formulation for temporal bin packing problems
European Journal of Operational Research | 2023-07-04 | Paper |
Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
Discrete Applied Mathematics | 2023-05-11 | Paper |
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
Optimization Letters | 2022-10-11 | Paper |
An introduction to stochastic bin packing-based server consolidation with conflicts
Top | 2022-06-16 | Paper |
Mathematical models and approximate solution approaches for the stochastic bin packing problem
Computers & Operations Research | 2022-03-09 | Paper |
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Computers & Operations Research | 2022-03-07 | 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 |
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 |
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 |
Integer linear programming models for the skiving stock problem
European Journal of Operational Research | 2016-10-07 | Paper |
