Guntram Scheithauer

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs.
EURO J. Comput. Optim., 2021

Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles.
Discret. Optim., 2021

2020
Improved flow-based formulations for the skiving stock problem.
Comput. Oper. Res., 2020

2019
Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation.
4OR, 2019

A Stochastic Bin Packing Approach for Server Consolidation with Conflicts.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads.
IEEE Trans. Parallel Distributed Syst., 2018

A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems.
Eur. J. Oper. Res., 2018

The skiving stock problem and its relation to hypergraph matchings.
Discret. Optim., 2018

Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case.
Ann. Oper. Res., 2018

An Improved Arcflow Model for the Skiving Stock Problem.
Proceedings of the Operations Research Proceedings 2018, 2018

2017
Integer Linear Programming Formulations for Cognitive Radio Resource Allocation.
IEEE Wirel. Commun. Lett., 2017

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

An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case.
Proceedings of the Operations Research Proceedings 2017, 2017

2016
On the global minimum in a balanced circular packing problem.
Optim. Lett., 2016

The proper relaxation and the proper gap of the skiving stock problem.
Math. Methods Oper. Res., 2016

Upper bounds for heuristic approaches to the strip packing problem.
Int. Trans. Oper. Res., 2016

Integer linear programming models for the skiving stock problem.
Eur. J. Oper. Res., 2016

Integer rounding and modified integer rounding for the skiving stock problem.
Discret. Optim., 2016

On the Solution of Generalized Spectrum Allocation Problems.
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.
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.
J. Glob. Optim., 2015

A railway maintenance scheduling problem with customer costs.
EURO J. Transp. Logist., 2015

Minimal proper non-IRUP instances of the one-dimensional cutting stock problem.
Discret. Appl. Math., 2015

LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap.
Proceedings of the Operations Research Proceedings 2015, 2015

Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem.
Proceedings of the Operations Research Proceedings 2015, 2015

Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem.
Proceedings of the Operations Research Proceedings 2015, 2015

2014
Relations between capacity utilization, minimal bin size and bin number.
Ann. Oper. Res., 2014

New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Conservative scales in packing problems.
OR Spectr., 2013

2012
LP bounds in various constraint programming approaches for orthogonal packing.
Comput. Oper. Res., 2012

2011
Covering a polygonal region by rectangles.
Comput. Optim. Appl., 2011

2010
Tools of mathematical modeling of arbitrary object packing problems.
Ann. Oper. Res., 2010

2009
One-dimensional relaxations and LP bounds for orthogonal packing.
Int. Trans. Oper. Res., 2009

2008
One-dimensional heuristics adapted for two-dimensional rectangular strip packing.
J. Oper. Res. Soc., 2008

2007
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting.
INFORMS J. Comput., 2007

2006
A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting.
Eur. J. Oper. Res., 2006

2004
Phi-functions for complex 2D-objects.
4OR, 2004

2002
Phi-functions for primary 2D-objects.
Stud. Inform. Univ., 2002

A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths.
Eur. J. Oper. Res., 2002

Families of non-IRUP instances of the one-dimensional cutting stoc problem.
Discret. Appl. Math., 2002

2001
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm.
J. Oper. Res. Soc., 2001

2000
An efficient approach for the multi-pallet loading problem.
Eur. J. Oper. Res., 2000

1999
Tighter relaxations for the cutting stock problem.
Eur. J. Oper. Res., 1999

1998
New cases of the cutting stock problem having MIRUP.
Math. Methods Oper. Res., 1998

4-Block heuristic for the rectangle packing problem.
Eur. J. Oper. Res., 1998

1997
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem.
Oper. Res. Lett., 1997

1994
On the MAXGAP Problem for Cutting Stock Problems.
J. Inf. Process. Cybern., 1994

1993
Computation of Optimal ø-simple Guillotine Cutting Patterns.
J. Inf. Process. Cybern., 1993

1991
A Three-dimensional Bin Packing Algorithm.
J. Inf. Process. Cybern., 1991

1988
The Partition of a Square in Rectangles with Equal Areas.
J. Inf. Process. Cybern., 1988

1985
Rekursive Berechnung von Minimalgerüsten für spezielle Subgrahen.
J. Inf. Process. Cybern., 1985

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


  Loading...