Mathematical models and approximate solution approaches for the stochastic bin packing problem

von Martinovic, John
Veröffentlicht in Computers & operations research (2021)

Integer linear programming models for the skiving stock problem

von Martinovic, John
Veröffentlicht in European journal of operational research (2016)

An improved upper bound for the gap of skiving stock instances of the divisible case

von Martinovic, John
Veröffentlicht in Operations research proceedings 2017 (2018)

The additive integrality gap of the skiving stock problem : theoretical concepts, upper bounds and construction principles

von Martinovic, John
Veröffentlicht 2018

Compact integer linear programming formulations for the temporal bin packing problem with fire-ups

von Martinovic, John
Veröffentlicht in Computers & operations research (2021)

On the Solution of Generalized Spectrum Allocation Problems

von Martinovic, John
Veröffentlicht in Gesellschaft für Operations-Research (2016 : Hamburg) Operations research proceedings 2016 (2018)

Cutting stock problems with nondeterministic item lengths : a new approach to server consolidation

von Martinovic, John
Veröffentlicht in 4OR (2019)

Improved flow-based formulations for the skiving stock problem

von Martinovic, John
Veröffentlicht in Computers & operations research (2020)

A combinatorial flow-based formulation for temporal bin packing problems

von Martinovic, John
Veröffentlicht in European journal of operational research (2023)