Publications
ARTICLES IN PEER-REVIEWED JOURNALS
- J. Martinovic, N. Strasdat:
"Theoretical Insights and a New Class of Valid Inequalities for the Temporal Bin Packing Problem with Fire-Ups"
in Pesquisa Operacional, vol. 44, Article e283503, 2024 (Link) - J. Martinovic, N. Strasdat:
"Worst-Case Analysis of Heuristic Approaches for the Temporal Bin Packing Problem with Fire-Ups"
in Annals of Operations Research, vol. 333, pp. 481-499, 2024 (Link) - L. Korbacher, S. Irnich, J. Martinovic, N. Strasdat:
"Solving the Skiving Stock Problem by a Combination of Stabilized Column Generation and the Reflect Arc-Flow Model"
in Discrete Applied Mathematics, vol. 334, pp. 145-162, 2023 (Link) - J. Martinovic, N. Strasdat, J. Valério de Carvalho, F. Furini:
"A Combinatorial Flow-based Formulation for Temporal Bin Packing Problems"
in European Journal of Operational Research, vol. 307, no. 2, pp. 554-574, 2023 (Link) - J. Martinovic, N. Strasdat, J. Valério de Carvalho, F. Furini:
"Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups"
in Optimization Letters, vol. 16, pp. 2333-2358, 2022 (Link) - J. Martinovic, M. Hähnel, W. Dargie, G. Scheithauer:
"A Stochastic Bin Packing Approach for Server Consolidation with Conflicts"
in TOP, vol. 30, pp. 296-331, 2022 (Link) - J. Martinovic:
"A Note on the Integrality Gap of Cutting and Skiving Stock Instances: Why 4/3 is an Upper Bound for the Divisible Case?"
in 4OR, vol. 20, pp. 85-104, 2022 (Link) - J. Martinovic, M. Selch:
"Mathematical Models and Approximate Solution Approaches for the Stochastic Bin Packing Problem"
in Computers & Operations Research, vol. 135, Article 105439, 2021 (Link) - J. Martinovic, N. Strasdat, M. Selch:
"Compact Integer Linear Programming Formulations for the Temporal Bin Packing Problem with Fire-Ups"
in Computers & Operations Research, vol. 132, Article 105288, 2021 (Link) - M.A. Dar, A. Fischer, J. Martinovic, G. Scheithauer:
"Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles"
in Discrete Optimization, vol. 40, Article 100623, 2021 (Link) - J. Martinovic, M. Delorme, M. Iori, G. Scheithauer, N.Strasdat:
"Improved Flow-based Formulations for the Skiving Stock Problem"
in Computers & Operations Research, vol. 113, Article 104770, 2020 (Link) - M.A. Dar, A. Fischer, J. Martinovic, G. Scheithauer:
"An Improved Flow-based Formulation and Reduction Principles for the Minimum Connectivity Inference Problem"
in Optimization, vol. 68, no. 10, pp. 1963-1983, 2019 (Link) - J. Martinovic, G. Scheithauer:
"New Theoretical Investigations on the Gap of the Skiving Stock Problem"
in Pesquisa Operacional, vol. 39, no. 1, pp. 1-35, 2019 (Link) - J. Martinovic, M. Hähnel, G. Scheithauer, W. Dargie, A. Fischer:
"Cutting Stock Problems with Nondeterministic Item Lengths: A New Approach to Server Consolidation"
in 4OR, vol. 17, no. 2, pp. 173-200, 2019 (Link) - J. Martinovic, G. Scheithauer:
"Characterizing IRDP-Instances of the Skiving Stock Problem by means of Polyhedral Theory"
in Optimization, vol. 67, no. 10, pp. 1797-1817, 2018 (Link) - M. Hähnel, J. Martinovic, G. Scheithauer, A. Fischer, A.Schill, W. Dargie:
"Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads"
in Transactions on Parallel and Distributed Systems, vol. 29, no. 11, pp. 2478-2488, 2018 (Link) - J. Martinovic, G. Scheithauer:
"The Skiving Stock Problem and its Relation to Hypergraph Matchings"
in Discrete Optimization, vol. 29, pp. 77-102, 2018 (Link) - J. Martinovic, G. Scheithauer:
"Combinatorial Investigations on the Maximum Gap for Skiving Stock Instances of the Divisible Case"
in Annals of Operations Research, vol. 271, no. 2, pp. 811-829, 2018 (Link) - J. Martinovic, G. Scheithauer, J.M. Valério de Carvalho:
"A Comparative Study of the Arcflow Model and the One-Cut Model for one-dimensional Cutting Stock Problems"
in European Journal of Operational Research, vol. 266, no. 2, pp. 458-471, 2018 (Link) - J. Martinovic, G. Scheithauer:
"An Upper Bound of Δ(E) < 3/2 for Skiving Stock Instances of the Divisible Case"
in Discrete Applied Mathematics, vol. 229, pp. 161-167, 2017 (Link) - J. Martinovic, E. Jorswieck, G. Scheithauer, A.Fischer:
"Integer Linear Programming Formulations for Cognitive Radio Resource Allocation"
in IEEE Wireless Communication Letters, vol. 6, no. 4, pp. 494-497, 2017 (Link) - J. Martinovic, G. Scheithauer:
"Integer Rounding and Modified Integer Rounding for the Skiving Stock Problem"
in Discrete Optimization, vol. 21, pp. 118-130, 2016 (Link) - J. Martinovic, G. Scheithauer:
"The Proper Relaxation and the Proper Gap of the Skiving Stock Problem"
in Mathematical Methods of Operations Research, vol. 84, no. 3, pp. 527-548, 2016 (Link) - J. Martinovic, G. Scheithauer:
"Integer linear programming models for the skiving stock problem"
in European Journal of Operational Research, vol. 251, no. 2, pp. 356-368, 2016 (Link) - J. Israel, A. Fischer, J. Martinovic, E. Jorswieck, M. Mesyagutov:
"Discrete Receive Beamforming"
in IEEE Signal Processing Letters, vol. 22, no. 7, pp. 958-962, 2015 (Link)
CONFERENCE PROCEEDINGS
- J. Martinovic, N. Strasdat:
"A Best-Cost Based Heuristic for Busy Time Minimization"
accepted for publication in Operations Research Proceedings 2023 - J. Martinovic, N. Strasdat, J.-F. Côté, V.L. de Lima:
"A Heuristic Column Generation Approach for the Stochastic Bin Packing Problem"
in Operations Research Proceedings 2022, pp. 131-138, 2023 (Link) - J. Martinovic, N. Strasdat:
"A Heuristic-based Reduction for the Temporal Bin Packing Problem with Fire-Ups"
in Operations Research Proceedings 2021, pp. 127-133, 2022 (Link) - J. Martinovic, M. Hähnel, W. Dargie, G. Scheithauer:
"A Stochastic Bin Packing Approach for Server Consolidation with Conflicts"
in Operations Research Proceedings 2019, pp. 159-165, 2020 (Link) - J. Martinovic, M. Delorme, M. Iori, G. Scheithauer:
"An Improved Arcflow Model for the Skiving Stock Problem"
in Operations Research Proceedings 2018, pp. 135-141, 2019 (Link) - M.A. Dar, A. Fischer, J. Martinovic, G. Scheithauer:
"A Computational Study of Reduction Techniques for the Minimum Connectivity Inference Problem"
in Advances in Mathematical Methods and High Performance Computing, Springer Advances in Mechanics and Mathematics, Chapter 7, pp. 135-148, 2019 (Link) - J. Martinovic, G. Scheithauer:
"An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case"
in Operations Research Proceedings 2017, pp.179-184, 2018 (Link) - J. Martinovic, E. Jorswieck, G. Scheithauer:
"On the Solution of Generalized Spectrum Allocation Problems"
in Operations Research Proceedings 2016, pp.133-138, 2018 (Link) - J. Martinovic, G. Scheithauer:
"LP-based Relaxations of the Skiving Stock Problem – Improved Upper Bounds for the Gap"
in Operations Research Proceedings 2015, pp. 49-54, 2017 (Link) - J. Martinovic, E. Jorswieck, G. Scheithauer:
"The Skiving Stock Problem and its Application to Cognitive Radio Networks"
in IFAC Papers Online, vol. 49, no. 12, pp. 99-104, 2016 (Link) - J.Israel, A. Fischer, J. Martinovic:
"Discrete and phase-only receive beamforming"
in Modern Mathematical Methods and High Performance Computing in Science and Technology, Springer Proceedings in Mathematics & Statistics, pp.141-153, 2016 (Link) - J.Israel, A. Fischer, J. Martinovic:
"A Branch-and-Bound Algorithm for Discrete Receive Beamforming with Improved Bounds"
in Proceedings of the International Conference on Ubiquitous Wireless Broadband (ICUWB'15), Montreal, Canada, 4.10. - 7.10.2015 (Link) - J. Israel, J. Martinovic, A. Fischer, M. Jenning, and L. Landau:
"Optimal Antenna Positioning for Wireless Board-To-Board Communication Using a Butler Matrix Beamforming Network"
in 17th International ITG Workshop on Smart Antennas (WSA 2013), Stuttgart, 2013 (Link)
RECENT PREPRINTS OR ASSOCIATED ARTICLES
- J. Martinovic, N. Strasdat:
"The Overflowing Bin Packing Problem: Theoretical Results and a New Flow Formulation"
Preprint MATH-NM-01-2024, Technische Universität Dresden, 2024 (Link) - J. Martinovic, N. Strasdat:
"Exact and Heuristic Solution Approaches for Busy Time Minimization in Temporal Bin Packing"
Preprint MATH-NM-01-2023, Technische Universität Dresden, 2023 (Link)
I contributed to these articles in an advisory role (see acknowledgements):
- Bonnet, É., Fălămaş, D.-E., Watrigant, R.:
"Constraint Generation Algorithm for the Minimum Connectivity Inference Problem"
in International Symposium on Experimental Algorithms, SEA 2019: Analysis of Experimental Algorithms, pp. 167--183, 2019 (Link) - A. Klausnitzer, R. Lasch:
"Optimal facility layout and material handling network design"
in Computers & Operations Research, vol. 103, pp. 237-251, 2019 (Link)