John Martinovic

According to our database, John Martinovic authored at least 28 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups.

John Martinovic, Nico Strasdat

Ann. Oper. Res., February, 2024

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., July, 2023

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., June, 2023

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 note on the integrality gap of cutting and skiving stock instances.

John Martinovic

4OR, 2022

2021

Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles.

Muhammad Abid Dar, Andreas Fischer, John Martinovic, Guntram Scheithauer

Discret. Optim., 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

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

John Martinovic, Maximilian Selch

Comput. Oper. Res., 2021

A Heuristic-Based Reduction for the Temporal Bin Packing Problem with Fire-Ups.

John Martinovic, Nico Strasdat

Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

2020

Improved flow-based formulations for the skiving stock problem.

John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat

Comput. Oper. Res., 2020

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

4OR, 2019

A Stochastic Bin Packing Approach for Server Consolidation with Conflicts.

John Martinovic, Markus Hähnel, Waltenegus Dargie, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2019, 2019

2018

Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads.

Marcus Hähnel, John Martinovic, Guntram Scheithauer, Andreas Fischer, Alexander Schill, Waltenegus Dargie

IEEE Trans. Parallel Distributed Syst., 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

The skiving stock problem and its relation to hypergraph matchings.

John Martinovic, Guntram Scheithauer

Discret. Optim., 2018

Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case.

John Martinovic, Guntram Scheithauer

Ann. Oper. Res., 2018

An Improved Arcflow Model for the Skiving Stock Problem.

John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2018, 2018

2017

Integer Linear Programming Formulations for Cognitive Radio Resource Allocation.

John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer, Andreas Fischer

IEEE Wirel. Commun. Lett., 2017

An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case.

John Martinovic, Guntram Scheithauer

Discret. Appl. Math., 2017

An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case.

John Martinovic, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2017, 2017

2016

The proper relaxation and the proper gap of the skiving stock problem.

John Martinovic, Guntram Scheithauer

Math. Methods Oper. Res., 2016

Integer linear programming models for the skiving stock problem.

John Martinovic, Guntram Scheithauer

Eur. J. Oper. Res., 2016

Integer rounding and modified integer rounding for the skiving stock problem.

John Martinovic, Guntram Scheithauer

Discret. Optim., 2016

On the Solution of Generalized Spectrum Allocation Problems.

John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2015

Discrete Receive Beamforming.

Johannes Israel, Andreas Fischer, John Martinovic, Eduard A. Jorswieck, Marat Mesyagutov

IEEE Signal Process. Lett., 2015

LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap.

John Martinovic, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2015, 2015

A Branch-and-Bound Algorithm for Discrete Receive Beamforming with Improved Bounds.

Johannes Israel, Andreas Fischer, John Martinovic

Proceedings of the IEEE International Conference on Ubiquitous Wireless Broadband, 2015

2013

Optimal Antenna Positioning for Wireless Board-To-Board Communication Using a Butler Matrix Beamforming Network.

Johannes Israel, John Martinovic, Andreas Fischer, Michael Jenning, Lukas Landau

Proceedings of the 17th International ITG Workshop on Smart Antennas, 2013