Guntram Scheithauer

ORCID

Publication Activity (10 Years)

Years Active: 1985-2021
Publications (10 Years): 20

Top Venues

Discret. Optim.

Comput. Oper. Res.

Eur. J. Oper. Res.

Dresden University of Technology, Germany (PHD)

Education History

Dresden University of Technology, Germany

PHD

Publications

Franziska Theurich, Andreas Fischer, Guntram Scheithauer
A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs. EURO J. Comput. Optim. 9 (2021)
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 (2021)
John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat
Improved flow-based formulations for the skiving stock problem. Comput. Oper. Res. 113 (2020)
John Martinovic, Markus Hähnel, Waltenegus Dargie, Guntram Scheithauer
A Stochastic Bin Packing Approach for Server Consolidation with Conflicts. OR (2019)
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) (2019)
John Martinovic, Guntram Scheithauer
The skiving stock problem and its relation to hypergraph matchings. Discret. Optim. 29 (2018)
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) (2018)
John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer
An Improved Arcflow Model for the Skiving Stock Problem. OR (2018)
John Martinovic, Guntram Scheithauer
Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case. Ann. Oper. Res. 271 (2) (2018)
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) (2018)
John Martinovic, Guntram Scheithauer
An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case. Discret. Appl. Math. 229 (2017)
John Martinovic, Guntram Scheithauer
An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case. OR (2017)
John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer, Andreas Fischer
Integer Linear Programming Formulations for Cognitive Radio Resource Allocation. IEEE Wirel. Commun. Lett. 6 (4) (2017)
John Martinovic, Guntram Scheithauer
Integer linear programming models for the skiving stock problem. Eur. J. Oper. Res. 251 (2) (2016)
John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer
On the Solution of Generalized Spectrum Allocation Problems. OR (2016)
Torsten Buchwald, Guntram Scheithauer
Creating Worst-Case Instances for Lower Bounds of the 2D Strip Packing Problem. OR (2016)
John Martinovic, Guntram Scheithauer
The proper relaxation and the proper gap of the skiving stock problem. Math. Methods Oper. Res. 84 (3) (2016)
John Martinovic, Guntram Scheithauer
Integer rounding and modified integer rounding for the skiving stock problem. Discret. Optim. 21 (2016)
Torsten Buchwald, Guntram Scheithauer
Upper bounds for heuristic approaches to the strip packing problem. Int. Trans. Oper. Res. 23 (1-2) (2016)
Petro I. Stetsyuk, Tatiana E. Romanova, Guntram Scheithauer
On the global minimum in a balanced circular packing problem. Optim. Lett. 10 (6) (2016)
Julia A. Bennell, Guntram Scheithauer, Yuri Stoyan, Tatiana E. Romanova, Aleksandr V. Pankratov
Optimal clustering of a pair of irregular objects. J. Glob. Optim. 61 (3) (2015)
Torsten Buchwald, Guntram Scheithauer
Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem. OR (2015)
Franziska Heinicke, Axel Simroth, Guntram Scheithauer, Andreas Fischer
A railway maintenance scheduling problem with customer costs. EURO J. Transp. Logist. 4 (1) (2015)
Vadim M. Kartak, Artem V. Ripatti, Guntram Scheithauer, Sascha Kurz
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. Discret. Appl. Math. 187 (2015)
John Martinovic, Guntram Scheithauer
LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap. OR (2015)
Isabel Friedow, Guntram Scheithauer
Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem. OR (2015)
Torsten Buchwald, Guntram Scheithauer
Upper Bounds for Heuristic Approaches to the Strip Packing Problem. OR (2014)
Torsten Buchwald, Kirsten Hoffmann, Guntram Scheithauer
Relations between capacity utilization, minimal bin size and bin number. Ann. Oper. Res. 217 (1) (2014)
Isabel Friedow, Guntram Scheithauer
New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem. OR (2014)
Gleb Belov, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer
Conservative scales in packing problems. OR Spectr. 35 (2) (2013)
M. Mesyagutov, Guntram Scheithauer, Gleb Belov
LP bounds in various constraint programming approaches for orthogonal packing. Comput. Oper. Res. 39 (10) (2012)
Yu. G. Stoyan, Tatiana E. Romanova, Guntram Scheithauer, A. Krivulya
Covering a polygonal region by rectangles. Comput. Optim. Appl. 48 (3) (2011)
Julia A. Bennell, Guntram Scheithauer, Yurij Stoyan, Tatiana E. Romanova
Tools of mathematical modeling of arbitrary object packing problems. Ann. Oper. Res. 179 (1) (2010)
Gleb Belov, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer
One-dimensional relaxations and LP bounds for orthogonal packing. Int. Trans. Oper. Res. 16 (6) (2009)
Gleb Belov, Guntram Scheithauer, E. A. Mukhacheva
One-dimensional heuristics adapted for two-dimensional rectangular strip packing. J. Oper. Res. Soc. 59 (6) (2008)
Gleb Belov, Guntram Scheithauer
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting. INFORMS J. Comput. 19 (1) (2007)
Gleb Belov, Guntram Scheithauer
A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur. J. Oper. Res. 171 (1) (2006)
Yurij Stoyan, Guntram Scheithauer, Nikolay Gil, Tatiana E. Romanova
Phi-functions for complex 2D-objects. 4OR 2 (1) (2004)
Jürgen Rietz, Guntram Scheithauer, Johannes Terno
Families of non-IRUP instances of the one-dimensional cutting stoc problem. Discret. Appl. Math. 121 (1-3) (2002)
Gleb Belov, Guntram Scheithauer
A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Eur. J. Oper. Res. 141 (2) (2002)
Yurij Stoyan, Johannes Terno, Guntram Scheithauer, Nikolay Gil, Tatiana E. Romanova
Phi-functions for primary 2D-objects. Stud. Inform. Univ. 2 (1) (2002)
Guntram Scheithauer, Johannes Terno, Antje Müller, Gleb Belov
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm. J. Oper. Res. Soc. 52 (12) (2001)
Johannes Terno, Guntram Scheithauer, Uta Sommerweiß, Jan Riehme
An efficient approach for the multi-pallet loading problem. Eur. J. Oper. Res. 123 (2) (2000)
Christoph Nitsche, Guntram Scheithauer, Johannes Terno
Tighter relaxations for the cutting stock problem. Eur. J. Oper. Res. 112 (3) (1999)
Guntram Scheithauer, Uta Sommerweiß
4-Block heuristic for the rectangle packing problem. Eur. J. Oper. Res. 108 (3) (1998)
Christoph Nitsche, Guntram Scheithauer, Johannes Terno
New cases of the cutting stock problem having MIRUP. Math. Methods Oper. Res. 48 (1) (1998)
Guntram Scheithauer, Johannes Terno
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem. Oper. Res. Lett. 20 (2) (1997)
Guntram Scheithauer
On the MAXGAP Problem for Cutting Stock Problems. J. Inf. Process. Cybern. 30 (2) (1994)
Guntram Scheithauer
Computation of Optimal ø-simple Guillotine Cutting Patterns. J. Inf. Process. Cybern. 29 (2) (1993)
Guntram Scheithauer
A Three-dimensional Bin Packing Algorithm. J. Inf. Process. Cybern. 27 (5/6) (1991)
Guntram Scheithauer, Johannes Terno
The Partition of a Square in Rectangles with Equal Areas. J. Inf. Process. Cybern. 24 (4/5) (1988)
Guntram Scheithauer
Rekursive Berechnung von Minimalgerüsten für spezielle Subgrahen. J. Inf. Process. Cybern. 21 (12) (1985)

Guntram Scheithauer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guntram Scheithauer