John Martinovic

30 papers Journal 21Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Bin packing with thresholds: mathematical models and theoretical results. Eur. J. Oper. Res. Ernest Foussard, John Martinovic, Marie-Laure Espinouse, Grégory Mounié, Margaux Nattaf
2024	J	`jnl`	Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups. Ann. Oper. Res. John Martinovic, Nico Strasdat
2023	J	`jnl`	A combinatorial flow-based formulation for temporal bin packing problems. Eur. J. Oper. Res. John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini
2023	J	`jnl`	Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model. Discret. Appl. Math. Laura Korbacher, Stefan Irnich, John Martinovic, Nico Strasdat
2022	—	`conf`	A Heuristic Column Generation Approach for the Stochastic Bin Packing Problem. OR John Martinovic, Nico Strasdat, Jean-François Côté, Vinícius Loti de Lima
2022	J	`jnl`	A note on the integrality gap of cutting and skiving stock instances. 4OR John Martinovic
2022	J	`jnl`	Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optim. Lett. John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini
2021	—	`conf`	A Heuristic-Based Reduction for the Temporal Bin Packing Problem with Fire-Ups. OR John Martinovic, Nico Strasdat
2021	J	`jnl`	Compact integer linear programming formulations for the temporal bin packing problem with fire-ups. Comput. Oper. Res. John Martinovic, Nico Strasdat, Maximilian Selch
2021	J	`jnl`	Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles. Discret. Optim. Muhammad Abid Dar, Andreas Fischer, John Martinovic, Guntram Scheithauer
2021	J	`jnl`	Mathematical models and approximate solution approaches for the stochastic bin packing problem. Comput. Oper. Res. John Martinovic, Maximilian Selch
2020	J	`jnl`	Improved flow-based formulations for the skiving stock problem. Comput. Oper. Res. John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat
2019	—	`conf`	A Stochastic Bin Packing Approach for Server Consolidation with Conflicts. OR John Martinovic, Markus Hähnel, Waltenegus Dargie, Guntram Scheithauer
2019	J	`jnl`	Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation. 4OR John Martinovic, Markus Hähnel, Guntram Scheithauer, Waltenegus Dargie, Andreas Fischer
2018	J	`jnl`	A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. Eur. J. Oper. Res. John Martinovic, Guntram Scheithauer, José M. Valério de Carvalho
2018	—	`conf`	An Improved Arcflow Model for the Skiving Stock Problem. OR John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer
2018	J	`jnl`	Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case. Ann. Oper. Res. John Martinovic, Guntram Scheithauer
2018	J	`jnl`	Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads. IEEE Trans. Parallel Distributed Syst. Marcus Hähnel, John Martinovic, Guntram Scheithauer, Andreas Fischer, Alexander Schill, Waltenegus Dargie
2018	J	`jnl`	The skiving stock problem and its relation to hypergraph matchings. Discret. Optim. John Martinovic, Guntram Scheithauer
2017	—	`conf`	An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case. OR John Martinovic, Guntram Scheithauer
2017	J	`jnl`	An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case. Discret. Appl. Math. John Martinovic, Guntram Scheithauer
2017	J	`jnl`	Integer Linear Programming Formulations for Cognitive Radio Resource Allocation. IEEE Wirel. Commun. Lett. John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer, Andreas Fischer
2016	J	`jnl`	Integer linear programming models for the skiving stock problem. Eur. J. Oper. Res. John Martinovic, Guntram Scheithauer
2016	J	`jnl`	Integer rounding and modified integer rounding for the skiving stock problem. Discret. Optim. John Martinovic, Guntram Scheithauer
2016	—	`conf`	On the Solution of Generalized Spectrum Allocation Problems. OR John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer
2016	J	`jnl`	The proper relaxation and the proper gap of the skiving stock problem. Math. Methods Oper. Res. John Martinovic, Guntram Scheithauer
2015	—	`conf`	A Branch-and-Bound Algorithm for Discrete Receive Beamforming with Improved Bounds. ICUWB Johannes Israel, Andreas Fischer, John Martinovic
2015	J	`jnl`	Discrete Receive Beamforming. IEEE Signal Process. Lett. Johannes Israel, Andreas Fischer, John Martinovic, Eduard A. Jorswieck, Marat Mesyagutov
2015	—	`conf`	LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap. OR John Martinovic, Guntram Scheithauer
2013	—	`conf`	Optimal Antenna Positioning for Wireless Board-To-Board Communication Using a Butler Matrix Beamforming Network. WSA Johannes Israel, John Martinovic, Andreas Fischer, Michael Jenning, Lukas Landau