Guntram Scheithauer

53 papers Journal 42Unranked 10
YearRankTypeTitle / Venue / Authors
2021 J jnl
A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs.
EURO J. Comput. Optim.
Franziska Theurich, Andreas Fischer, Guntram Scheithauer
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
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 — conf
Creating Worst-Case Instances for Lower Bounds of the 2D Strip Packing Problem.
OR
Torsten Buchwald, Guntram Scheithauer
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
On the global minimum in a balanced circular packing problem.
Optim. Lett.
Petro I. Stetsyuk, Tatiana E. Romanova, 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
2016 J jnl
Upper bounds for heuristic approaches to the strip packing problem.
Int. Trans. Oper. Res.
Torsten Buchwald, Guntram Scheithauer
2015 J jnl
A railway maintenance scheduling problem with customer costs.
EURO J. Transp. Logist.
Franziska Heinicke, Axel Simroth, Guntram Scheithauer, Andreas Fischer
2015 — conf
Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem.
OR
Torsten Buchwald, Guntram Scheithauer
2015 — conf
LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap.
OR
John Martinovic, Guntram Scheithauer
2015 J jnl
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem.
Discret. Appl. Math.
Vadim M. Kartak, Artem V. Ripatti, Guntram Scheithauer, Sascha Kurz
2015 J jnl
Optimal clustering of a pair of irregular objects.
J. Glob. Optim.
Julia A. Bennell, Guntram Scheithauer, Yuri Stoyan, Tatiana E. Romanova, Aleksandr V. Pankratov
2015 — conf
Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem.
OR
Isabel Friedow, Guntram Scheithauer
2014 — conf
New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem.
OR
Isabel Friedow, Guntram Scheithauer
2014 J jnl
Relations between capacity utilization, minimal bin size and bin number.
Ann. Oper. Res.
Torsten Buchwald, Kirsten Hoffmann, Guntram Scheithauer
2014 — conf
Upper Bounds for Heuristic Approaches to the Strip Packing Problem.
OR
Torsten Buchwald, Guntram Scheithauer
2013 J jnl
Conservative scales in packing problems.
OR Spectr.
Gleb Belov, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer
2012 J jnl
LP bounds in various constraint programming approaches for orthogonal packing.
Comput. Oper. Res.
M. Mesyagutov, Guntram Scheithauer, Gleb Belov
2011 J jnl
Covering a polygonal region by rectangles.
Comput. Optim. Appl.
Yu. G. Stoyan, Tatiana E. Romanova, Guntram Scheithauer, A. Krivulya
2010 J jnl
Tools of mathematical modeling of arbitrary object packing problems.
Ann. Oper. Res.
Julia A. Bennell, Guntram Scheithauer, Yurij Stoyan, Tatiana E. Romanova
2009 J jnl
One-dimensional relaxations and LP bounds for orthogonal packing.
Int. Trans. Oper. Res.
Gleb Belov, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer
2008 J jnl
One-dimensional heuristics adapted for two-dimensional rectangular strip packing.
J. Oper. Res. Soc.
Gleb Belov, Guntram Scheithauer, E. A. Mukhacheva
2007 J jnl
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting.
INFORMS J. Comput.
Gleb Belov, Guntram Scheithauer
2006 J jnl
A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting.
Eur. J. Oper. Res.
Gleb Belov, Guntram Scheithauer
2004 J jnl
Phi-functions for complex 2D-objects.
4OR
Yurij Stoyan, Guntram Scheithauer, Nikolay Gil, Tatiana E. Romanova
2002 J jnl
A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths.
Eur. J. Oper. Res.
Gleb Belov, Guntram Scheithauer
2002 J jnl
Families of non-IRUP instances of the one-dimensional cutting stoc problem.
Discret. Appl. Math.
Jürgen Rietz, Guntram Scheithauer, Johannes Terno
2002 J jnl
Phi-functions for primary 2D-objects.
Stud. Inform. Univ.
Yurij Stoyan, Johannes Terno, Guntram Scheithauer, Nikolay Gil, Tatiana E. Romanova
2001 J jnl
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm.
J. Oper. Res. Soc.
Guntram Scheithauer, Johannes Terno, Antje Müller, Gleb Belov
2000 J jnl
An efficient approach for the multi-pallet loading problem.
Eur. J. Oper. Res.
Johannes Terno, Guntram Scheithauer, Uta Sommerweiß, Jan Riehme
1999 J jnl
Tighter relaxations for the cutting stock problem.
Eur. J. Oper. Res.
Christoph Nitsche, Guntram Scheithauer, Johannes Terno
1998 J jnl
4-Block heuristic for the rectangle packing problem.
Eur. J. Oper. Res.
Guntram Scheithauer, Uta Sommerweiß
1998 J jnl
New cases of the cutting stock problem having MIRUP.
Math. Methods Oper. Res.
Christoph Nitsche, Guntram Scheithauer, Johannes Terno
1997 J jnl
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem.
Oper. Res. Lett.
Guntram Scheithauer, Johannes Terno
1994 J jnl
On the MAXGAP Problem for Cutting Stock Problems.
J. Inf. Process. Cybern.
Guntram Scheithauer
1993 J jnl
Computation of Optimal ø-simple Guillotine Cutting Patterns.
J. Inf. Process. Cybern.
Guntram Scheithauer
1991 J jnl
A Three-dimensional Bin Packing Algorithm.
J. Inf. Process. Cybern.
Guntram Scheithauer
1988 J jnl
The Partition of a Square in Rectangles with Equal Areas.
J. Inf. Process. Cybern.
Guntram Scheithauer, Johannes Terno
1985 J jnl
Rekursive Berechnung von Minimalgerüsten für spezielle Subgrahen.
J. Inf. Process. Cybern.
Guntram Scheithauer
1983 — —
Äquivalenz, Symmetrie und Rekursivität bei Branch-and-Bound-Verfahren am Beispiel des Traveling-Salesman-Problem.
Guntram Scheithauer