Optimal Antenna Positioning for Wireless Board-To-Board Communication Using a Butler Matrix Beamforming Network. - Johannes Israel; John Martinovic; Andreas Fischer 004; Michael Jenning; Lukas Landau (WSA, 2013)

A Branch-and-Bound Algorithm for Discrete Receive Beamforming with Improved Bounds. - Johannes Israel; Andreas Fischer 004; John Martinovic (ICUWB, 2015)

LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap. - John Martinovic; Guntram Scheithauer (OR, 2015)

Discrete Receive Beamforming. - Johannes Israel; Andreas Fischer 004; John Martinovic; Eduard A. Jorswieck; Marat Mesyagutov (IEEE Signal Process. Lett., 2015)

On the Solution of Generalized Spectrum Allocation Problems. - John Martinovic; Eduard A. Jorswieck; Guntram Scheithauer (OR, 2016)

Integer rounding and modified integer rounding for the skiving stock problem. - John Martinovic; Guntram Scheithauer (Discret. Optim., 2016)

Integer linear programming models for the skiving stock problem. - John Martinovic; Guntram Scheithauer (Eur. J. Oper. Res., 2016)

The proper relaxation and the proper gap of the skiving stock problem. - John Martinovic; Guntram Scheithauer (Math. Methods Oper. Res., 2016)

An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case. - John Martinovic; Guntram Scheithauer (OR, 2017)

An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case. - John Martinovic; Guntram Scheithauer (Discret. Appl. Math., 2017)

Integer Linear Programming Formulations for Cognitive Radio Resource Allocation. - John Martinovic; Eduard A. Jorswieck; Guntram Scheithauer; Andreas Fischer 004 (IEEE Wirel. Commun. Lett., 2017)

An Improved Arcflow Model for the Skiving Stock Problem. - John Martinovic; Maxence Delorme; Manuel Iori; Guntram Scheithauer (OR, 2018)

Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case. - John Martinovic; Guntram Scheithauer (Ann. Oper. Res., 2018)

The skiving stock problem and its relation to hypergraph matchings. - John Martinovic; Guntram Scheithauer (Discret. Optim., 2018)

A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. - John Martinovic; Guntram Scheithauer; José M. Valério de Carvalho (Eur. J. Oper. Res., 2018)

Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads. - Marcus Hähnel; John Martinovic; Guntram Scheithauer; Andreas Fischer 004; Alexander Schill; Waltenegus Dargie (IEEE Trans. Parallel Distributed Syst., 2018)

A Stochastic Bin Packing Approach for Server Consolidation with Conflicts. - John Martinovic; Markus Hähnel; Waltenegus Dargie; Guntram Scheithauer (OR, 2019)

Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation. - John Martinovic; Markus Hähnel; Guntram Scheithauer; Waltenegus Dargie; Andreas Fischer 004 (4OR, 2019)

Improved flow-based formulations for the skiving stock problem. - John Martinovic; Maxence Delorme; Manuel Iori; Guntram Scheithauer; Nico Strasdat (Comput. Oper. Res., 2020)

A Heuristic-Based Reduction for the Temporal Bin Packing Problem with Fire-Ups. - John Martinovic; Nico Strasdat (OR, 2021)

Mathematical models and approximate solution approaches for the stochastic bin packing problem. - John Martinovic; Maximilian Selch (Comput. Oper. Res., 2021)

Compact integer linear programming formulations for the temporal bin packing problem with fire-ups. - John Martinovic; Nico Strasdat; Maximilian Selch (Comput. Oper. Res., 2021)

Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles. - Muhammad Abid Dar; Andreas Fischer 004; John Martinovic; Guntram Scheithauer (Discret. Optim., 2021)

A Heuristic Column Generation Approach for the Stochastic Bin Packing Problem. - John Martinovic; Nico Strasdat; Jean-François Côté; Vinícius Loti de Lima (OR, 2022)

A note on the integrality gap of cutting and skiving stock instances. - John Martinovic (4OR, 2022)

Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. - John Martinovic; Nico Strasdat; José M. Valério de Carvalho; Fabio Furini (Optim. Lett., 2022)

A combinatorial flow-based formulation for temporal bin packing problems. - John Martinovic; Nico Strasdat; José M. Valério de Carvalho; Fabio Furini (Eur. J. Oper. Res., 2023)

Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model. - Laura Korbacher; Stefan Irnich; John Martinovic; Nico Strasdat (Discret. Appl. Math., 2023)

Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups. - John Martinovic; Nico Strasdat (Ann. Oper. Res., 2024)