Guntram Scheithauer

According to our database, Guntram Scheithauer authored at least 52 papers between 1983 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs.

Franziska Theurich, Andreas Fischer, Guntram Scheithauer

EURO J. Comput. Optim., 2021

Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles.

Muhammad Abid Dar, Andreas Fischer, John Martinovic, Guntram Scheithauer

Discret. Optim., 2021

2020

Improved flow-based formulations for the skiving stock problem.

John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat

Comput. Oper. Res., 2020

2019

Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation.

John Martinovic, Markus Hähnel, Guntram Scheithauer, Waltenegus Dargie, Andreas Fischer

4OR, 2019

A Stochastic Bin Packing Approach for Server Consolidation with Conflicts.

John Martinovic, Markus Hähnel, Waltenegus Dargie, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2019, 2019

2018

Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads.

Marcus Hähnel, John Martinovic, Guntram Scheithauer, Andreas Fischer, Alexander Schill, Waltenegus Dargie

IEEE Trans. Parallel Distributed Syst., 2018

A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems.

John Martinovic, Guntram Scheithauer, José M. Valério de Carvalho

Eur. J. Oper. Res., 2018

The skiving stock problem and its relation to hypergraph matchings.

John Martinovic, Guntram Scheithauer

Discret. Optim., 2018

Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case.

John Martinovic, Guntram Scheithauer

Ann. Oper. Res., 2018

An Improved Arcflow Model for the Skiving Stock Problem.

John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2018, 2018

2017

Integer Linear Programming Formulations for Cognitive Radio Resource Allocation.

John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer, Andreas Fischer

IEEE Wirel. Commun. Lett., 2017

An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case.

John Martinovic, Guntram Scheithauer

Discret. Appl. Math., 2017

An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case.

John Martinovic, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2017, 2017

2016

On the global minimum in a balanced circular packing problem.

Petro I. Stetsyuk, Tatiana E. Romanova, Guntram Scheithauer

Optim. Lett., 2016

The proper relaxation and the proper gap of the skiving stock problem.

John Martinovic, Guntram Scheithauer

Math. Methods Oper. Res., 2016

Upper bounds for heuristic approaches to the strip packing problem.

Torsten Buchwald, Guntram Scheithauer

Int. Trans. Oper. Res., 2016

Integer linear programming models for the skiving stock problem.

John Martinovic, Guntram Scheithauer

Eur. J. Oper. Res., 2016

Integer rounding and modified integer rounding for the skiving stock problem.

John Martinovic, Guntram Scheithauer

Discret. Optim., 2016

On the Solution of Generalized Spectrum Allocation Problems.

John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

Creating Worst-Case Instances for Lower Bounds of the 2D Strip Packing Problem.

Torsten Buchwald, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2015

Optimal clustering of a pair of irregular objects.

Julia A. Bennell, Guntram Scheithauer, Yuri Stoyan, Tatiana E. Romanova, Aleksandr V. Pankratov

J. Glob. Optim., 2015

A railway maintenance scheduling problem with customer costs.

Franziska Heinicke, Axel Simroth, Guntram Scheithauer, Andreas Fischer

EURO J. Transp. Logist., 2015

Minimal proper non-IRUP instances of the one-dimensional cutting stock problem.

Vadim M. Kartak, Artem V. Ripatti, Guntram Scheithauer, Sascha Kurz

Discret. Appl. Math., 2015

LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap.

John Martinovic, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2015, 2015

Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem.

Isabel Friedow, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2015, 2015

Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem.

Torsten Buchwald, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2015, 2015

2014

Relations between capacity utilization, minimal bin size and bin number.

Torsten Buchwald, Kirsten Hoffmann, Guntram Scheithauer

Ann. Oper. Res., 2014

New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem.

Isabel Friedow, Guntram Scheithauer

Proceedings of the Operations Research Proceedings 2014, 2014

2013

Conservative scales in packing problems.

Gleb Belov, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer

OR Spectr., 2013

2012

LP bounds in various constraint programming approaches for orthogonal packing.

M. Mesyagutov, Guntram Scheithauer, Gleb Belov

Comput. Oper. Res., 2012

2011

Covering a polygonal region by rectangles.

Yu. G. Stoyan, Tatiana E. Romanova, Guntram Scheithauer, A. Krivulya

Comput. Optim. Appl., 2011

2010

Tools of mathematical modeling of arbitrary object packing problems.

Julia A. Bennell, Guntram Scheithauer, Yurij Stoyan, Tatiana E. Romanova

Ann. Oper. Res., 2010

2009

One-dimensional relaxations and LP bounds for orthogonal packing.

Gleb Belov, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer

Int. Trans. Oper. Res., 2009

2008

One-dimensional heuristics adapted for two-dimensional rectangular strip packing.

Gleb Belov, Guntram Scheithauer, E. A. Mukhacheva

J. Oper. Res. Soc., 2008

2007

Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting.

Gleb Belov, Guntram Scheithauer

INFORMS J. Comput., 2007

2006

A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting.

Gleb Belov, Guntram Scheithauer

Eur. J. Oper. Res., 2006

2004

Phi-functions for complex 2D-objects.

Yurij Stoyan, Guntram Scheithauer, Nikolay Gil, Tatiana E. Romanova

4OR, 2004

2002

Phi-functions for primary 2D-objects.

Yurij Stoyan, Johannes Terno, Guntram Scheithauer, Nikolay Gil, Tatiana E. Romanova

Stud. Inform. Univ., 2002

A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths.

Gleb Belov, Guntram Scheithauer

Eur. J. Oper. Res., 2002

Families of non-IRUP instances of the one-dimensional cutting stoc problem.

Jürgen Rietz, Guntram Scheithauer, Johannes Terno

Discret. Appl. Math., 2002

2001

Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm.

Guntram Scheithauer, Johannes Terno, Antje Müller, Gleb Belov

J. Oper. Res. Soc., 2001

2000

An efficient approach for the multi-pallet loading problem.

Johannes Terno, Guntram Scheithauer, Uta Sommerweiß, Jan Riehme

Eur. J. Oper. Res., 2000

1999

Tighter relaxations for the cutting stock problem.

Christoph Nitsche, Guntram Scheithauer, Johannes Terno

Eur. J. Oper. Res., 1999

1998

New cases of the cutting stock problem having MIRUP.

Christoph Nitsche, Guntram Scheithauer, Johannes Terno

Math. Methods Oper. Res., 1998

4-Block heuristic for the rectangle packing problem.

Guntram Scheithauer, Uta Sommerweiß

Eur. J. Oper. Res., 1998

1997

Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem.

Guntram Scheithauer, Johannes Terno

Oper. Res. Lett., 1997

1994

On the MAXGAP Problem for Cutting Stock Problems.

Guntram Scheithauer

J. Inf. Process. Cybern., 1994

1993

Computation of Optimal ø-simple Guillotine Cutting Patterns.

Guntram Scheithauer

J. Inf. Process. Cybern., 1993

1991

A Three-dimensional Bin Packing Algorithm.

Guntram Scheithauer

J. Inf. Process. Cybern., 1991

1988

The Partition of a Square in Rectangles with Equal Areas.

Guntram Scheithauer, Johannes Terno

J. Inf. Process. Cybern., 1988

1985

Rekursive Berechnung von Minimalgerüsten für spezielle Subgrahen.

Guntram Scheithauer

J. Inf. Process. Cybern., 1985

1983

Äquivalenz, Symmetrie und Rekursivität bei Branch-and-Bound-Verfahren am Beispiel des Traveling-Salesman-Problem.

Guntram Scheithauer

PhD thesis, 1983