default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Martinovic
Person information
- affiliation: Technische Universität Dresden, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j20]John Martinovic
, Nico Strasdat:
Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups. Ann. Oper. Res. 333(1): 481-499 (2024)- 2023
- [j19]Laura Korbacher, Stefan Irnich, John Martinovic, Nico Strasdat:
Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model. Discret. Appl. Math. 334: 145-162 (2023) - [j18]John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini:
A combinatorial flow-based formulation for temporal bin packing problems. Eur. J. Oper. Res. 307(2): 554-574 (2023) - 2022
- [j17]John Martinovic:
A note on the integrality gap of cutting and skiving stock instances. 4OR 20(1): 85-104 (2022) - [j16]John Martinovic, Nico Strasdat, José M. Valério de Carvalho, Fabio Furini:
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optim. Lett. 16(8): 2333-2358 (2022) - 2021
- [j15]John Martinovic, Nico Strasdat, Maximilian Selch:
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups. Comput. Oper. Res. 132: 105288 (2021) - [j14]John Martinovic, Maximilian Selch:
Mathematical models and approximate solution approaches for the stochastic bin packing problem. Comput. Oper. Res. 135: 105439 (2021) - [j13]Muhammad Abid Dar, Andreas Fischer, John Martinovic, Guntram Scheithauer:
Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles. Discret. Optim. 40: 100623 (2021) - 2020
- [j12]John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat:
Improved flow-based formulations for the skiving stock problem. Comput. Oper. Res. 113 (2020) - 2019
- [j11]John Martinovic, Markus Hähnel, Guntram Scheithauer, Waltenegus Dargie, Andreas Fischer:
Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation. 4OR 17(2): 173-200 (2019) - 2018
- [j10]John Martinovic, Guntram Scheithauer:
Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case. Ann. Oper. Res. 271(2): 811-829 (2018) - [j9]John Martinovic, Guntram Scheithauer:
The skiving stock problem and its relation to hypergraph matchings. Discret. Optim. 29: 77-102 (2018) - [j8]John Martinovic, Guntram Scheithauer, José M. Valério de Carvalho:
A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. Eur. J. Oper. Res. 266(2): 458-471 (2018) - [j7]Marcus Hähnel, John Martinovic, Guntram Scheithauer, Andreas Fischer, Alexander Schill, Waltenegus Dargie:
Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads. IEEE Trans. Parallel Distributed Syst. 29(11): 2478-2488 (2018) - 2017
- [j6]John Martinovic, Guntram Scheithauer:
An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case. Discret. Appl. Math. 229: 161-167 (2017) - [j5]John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer, Andreas Fischer:
Integer Linear Programming Formulations for Cognitive Radio Resource Allocation. IEEE Wirel. Commun. Lett. 6(4): 494-497 (2017) - 2016
- [j4]John Martinovic, Guntram Scheithauer:
Integer rounding and modified integer rounding for the skiving stock problem. Discret. Optim. 21: 118-130 (2016) - [j3]John Martinovic, Guntram Scheithauer:
Integer linear programming models for the skiving stock problem. Eur. J. Oper. Res. 251(2): 356-368 (2016) - [j2]John Martinovic, Guntram Scheithauer:
The proper relaxation and the proper gap of the skiving stock problem. Math. Methods Oper. Res. 84(3): 527-548 (2016) - 2015
- [j1]Johannes Israel, Andreas Fischer, John Martinovic, Eduard A. Jorswieck, Marat Mesyagutov:
Discrete Receive Beamforming. IEEE Signal Process. Lett. 22(7): 958-962 (2015)
Conference and Workshop Papers
- 2022
- [c9]John Martinovic, Nico Strasdat, Jean-François Côté, Vinícius Loti de Lima:
A Heuristic Column Generation Approach for the Stochastic Bin Packing Problem. OR 2022: 131-138 - 2021
- [c8]John Martinovic, Nico Strasdat:
A Heuristic-Based Reduction for the Temporal Bin Packing Problem with Fire-Ups. OR 2021: 127-133 - 2019
- [c7]John Martinovic, Markus Hähnel, Waltenegus Dargie, Guntram Scheithauer:
A Stochastic Bin Packing Approach for Server Consolidation with Conflicts. OR 2019: 159-165 - 2018
- [c6]John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer:
An Improved Arcflow Model for the Skiving Stock Problem. OR 2018: 135-141 - 2017
- [c5]John Martinovic, Guntram Scheithauer:
An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case. OR 2017: 179-184 - 2016
- [c4]John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer:
On the Solution of Generalized Spectrum Allocation Problems. OR 2016: 133-138 - 2015
- [c3]Johannes Israel, Andreas Fischer, John Martinovic:
A Branch-and-Bound Algorithm for Discrete Receive Beamforming with Improved Bounds. ICUWB 2015: 1-5 - [c2]John Martinovic, Guntram Scheithauer:
LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap. OR 2015: 49-54 - 2013
- [c1]Johannes Israel, John Martinovic, Andreas Fischer, Michael Jenning, Lukas Landau:
Optimal Antenna Positioning for Wireless Board-To-Board Communication Using a Butler Matrix Beamforming Network. WSA 2013: 1-7
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
