Guntram Scheithauer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 53 from 53

2021

Integer linear programming formulations for the minimum connectivity inference problem and model reduction principlesMuhammad Abid Dar, Andreas Fischer 0004, John Martinovic, Guntram Scheithauer. disopt, 40:100623, 2021. [doi]

A branch-and-bound approach for a Vehicle Routing Problem with Customer CostsFranziska Theurich, Andreas Fischer 0004, Guntram Scheithauer. ejco, 9:100003, 2021. [doi]

2020

Improved flow-based formulations for the skiving stock problemJohn Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat. cor, 113, 2020. [doi]

2019

A Stochastic Bin Packing Approach for Server Consolidation with ConflictsJohn Martinovic, Markus Hähnel, Waltenegus Dargie, Guntram Scheithauer. or 2020: 159-165 [doi]

Cutting stock problems with nondeterministic item lengths: a new approach to server consolidationJohn Martinovic, Markus Hähnel, Guntram Scheithauer, Waltenegus Dargie, Andreas Fischer 0004. 4or, 17(2):173-200, 2019. [doi]

2018

Extending the Cutting Stock Problem for Consolidating Services with Stochastic WorkloadsMarcus Hähnel, John Martinovic, Guntram Scheithauer, Andreas Fischer 0004, Alexander Schill, Waltenegus Dargie. tpds, 29(11):2478-2488, 2018. [doi]

Combinatorial investigations on the maximum gap for skiving stock instances of the divisible caseJohn Martinovic, Guntram Scheithauer. anor, 271(2):811-829, 2018. [doi]

A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problemsJohn Martinovic, Guntram Scheithauer, José M. Valério de Carvalho. eor, 266(2):458-471, 2018. [doi]

The skiving stock problem and its relation to hypergraph matchingsJohn Martinovic, Guntram Scheithauer. disopt, 29:77-102, 2018. [doi]

An Improved Arcflow Model for the Skiving Stock ProblemJohn Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer. or 2019: 135-141 [doi]

2017

An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible caseJohn Martinovic, Guntram Scheithauer. DAM, 229:161-167, 2017. [doi]

An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible CaseJohn Martinovic, Guntram Scheithauer. or 2018: 179-184 [doi]

Integer Linear Programming Formulations for Cognitive Radio Resource AllocationJohn Martinovic, Eduard A. Jorswieck, Guntram Scheithauer, Andreas Fischer. wcl, 6(4):494-497, 2017. [doi]

2016

Upper bounds for heuristic approaches to the strip packing problemTorsten Buchwald, Guntram Scheithauer. itor, 23(1-2):93-119, 2016. [doi]

Creating Worst-Case Instances for Lower Bounds of the 2D Strip Packing ProblemTorsten Buchwald, Guntram Scheithauer. or 2018: 103-109 [doi]

Integer rounding and modified integer rounding for the skiving stock problemJohn Martinovic, Guntram Scheithauer. disopt, 21:118-130, 2016. [doi]

Integer linear programming models for the skiving stock problemJohn Martinovic, Guntram Scheithauer. eor, 251(2):356-368, 2016. [doi]

The proper relaxation and the proper gap of the skiving stock problemJohn Martinovic, Guntram Scheithauer. mmor, 84(3):527-548, 2016. [doi]

On the Solution of Generalized Spectrum Allocation ProblemsJohn Martinovic, Eduard A. Jorswieck, Guntram Scheithauer. or 2018: 133-138 [doi]

On the global minimum in a balanced circular packing problemPetro I. Stetsyuk, Tatiana E. Romanova, Guntram Scheithauer. ol, 10(6):1347-1360, 2016. [doi]

2015

Optimal clustering of a pair of irregular objectsJulia A. Bennell, Guntram Scheithauer, Yuri Stoyan, Tatiana Romanova, Aleksandr Pankratov. jgo, 61(3):497-524, 2015. [doi]

Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing ProblemTorsten Buchwald, Guntram Scheithauer. or 2017: 55-61 [doi]

Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing ProblemIsabel Friedow, Guntram Scheithauer. or 2017: 71-77 [doi]

A railway maintenance scheduling problem with customer costsFranziska Heinicke, Axel Simroth, Guntram Scheithauer, Andreas Fischer 0004. ejtl, 4(1):113-137, 2015. [doi]

Minimal proper non-IRUP instances of the one-dimensional cutting stock problemVadim M. Kartak, Artem V. Ripatti, Guntram Scheithauer, Sascha Kurz. DAM, 187:120-129, 2015. [doi]

LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the GapJohn Martinovic, Guntram Scheithauer. or 2017: 49-54 [doi]

2014

Relations between capacity utilization, minimal bin size and bin numberTorsten Buchwald, Kirsten Hoffmann, Guntram Scheithauer. anor, 217(1):55-76, 2014. [doi]

Upper Bounds for Heuristic Approaches to the Strip Packing ProblemTorsten Buchwald, Guntram Scheithauer. or 2016: 65-70 [doi]

New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing ProblemIsabel Friedow, Guntram Scheithauer. or 2016: 151-157 [doi]

2013

Conservative scales in packing problemsGleb Belov, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer. ors, 35(2):505-542, 2013. [doi]

2012

LP bounds in various constraint programming approaches for orthogonal packingM. Mesyagutov, Guntram Scheithauer, Gleb Belov. cor, 39(10):2425-2438, 2012. [doi]

2011

Covering a polygonal region by rectanglesYu. G. Stoyan, Tatiana Romanova, Guntram Scheithauer, A. Krivulya. coap, 48(3):675-695, 2011. [doi]

2010

Tools of mathematical modeling of arbitrary object packing problemsJulia A. Bennell, Guntram Scheithauer, Yurij Stoyan, Tatiana Romanova. anor, 179(1):343-368, 2010. [doi]

2009

One-dimensional relaxations and LP bounds for orthogonal packingGleb Belov, Vadim M. Kartak, Heide Rohling, Guntram Scheithauer. itor, 16(6):745-766, 2009. [doi]

2008

One-dimensional heuristics adapted for two-dimensional rectangular strip packingGleb Belov, Guntram Scheithauer, E. A. Mukhacheva. jors, 59(6):823-832, 2008. [doi]

2007

Setup and Open-Stacks Minimization in One-Dimensional Stock CuttingGleb Belov, Guntram Scheithauer. informs, 19(1):27-35, 2007. [doi]

2006

A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cuttingG. Belov, Guntram Scheithauer. eor, 171(1):85-106, 2006. [doi]

2004

Phi-functions for complex 2D-objectsYurij Stoyan, Guntram Scheithauer, Nikolay Gil, Tatiana Romanova. 4or, 2(1):69-84, 2004. [doi]

2002

A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengthsG. Belov, Guntram Scheithauer. eor, 141(2):274-294, 2002. [doi]

Families of non-IRUP instances of the one-dimensional cutting stoc problemJürgen Rietz, Guntram Scheithauer, Johannes Terno. DAM, 121(1-3):229-245, 2002.

Phi-functions for primary 2D-objectsYurij Stoyan, Johannes Terno, Guntram Scheithauer, Nikolay Gil, Tatiana Romanova. siu, 2(1):1-32, 2002. [doi]

2001

Solving one-dimensional cutting stock problems exactly with a cutting plane algorithmGuntram Scheithauer, Johannes Terno, Antje Müller, Gleb Belov. jors, 52(12):1390-1401, 2001. [doi]

2000

An efficient approach for the multi-pallet loading problemJohannes Terno, Guntram Scheithauer, Uta Sommerweiß, Jan Riehme. eor, 123(2):372-381, 2000. [doi]

1999

Tighter relaxations for the cutting stock problemChristoph Nitsche, Guntram Scheithauer, Johannes Terno. eor, 112(3):654-663, 1999. [doi]

1998

New cases of the cutting stock problem having MIRUPChristoph Nitsche, Guntram Scheithauer, Johannes Terno. mmor, 48(1):105-115, 1998. [doi]

4-Block heuristic for the rectangle packing problemGuntram Scheithauer, Uta Sommerweiß. eor, 108(3):509-526, 1998. [doi]

1997

Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problemGuntram Scheithauer, Johannes Terno. orl, 20(2):93-100, 1997. [doi]

1994

On the MAXGAP Problem for Cutting Stock ProblemsGuntram Scheithauer. eik, 30(2):111-117, 1994.

1993

Computation of Optimal ø-simple Guillotine Cutting PatternsGuntram Scheithauer. eik, 29(2):115-128, 1993.

1991

A Three-dimensional Bin Packing AlgorithmGuntram Scheithauer. eik, 27(5/6):263-271, 1991.

1988

The Partition of a Square in Rectangles with Equal AreasGuntram Scheithauer, Johannes Terno. eik, 24(4/5):189-200, 1988.

1985

Rekursive Berechnung von Minimalgerüsten für spezielle SubgrahenGuntram Scheithauer. eik, 21(12):613-624, 1985.

1983

Äquivalenz, Symmetrie und Rekursivität bei Branch-and-Bound-Verfahren am Beispiel des Traveling-Salesman-ProblemGuntram Scheithauer. PhD thesis, Dresden University of Technology, Germany, 1983. [doi]

Sign in or sign up to see more results.

runs on WebDSL