default search action
Guntram Scheithauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j42]Muhammad Abid Dar
, Andreas Fischer
Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles. Discret. Optim. 40: 100623 (2021) - [j41]Franziska Theurich, Andreas Fischer
A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs. EURO J. Comput. Optim. 9: 100003 (2021) - 2020
- [j40]John Martinovic, Maxence Delorme
Improved flow-based formulations for the skiving stock problem. Comput. Oper. Res. 113 (2020)
2010 – 2019
- 2019
- [j39]John Martinovic
Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation. 4OR 17(2): 173-200 (2019) - [c10]John Martinovic, Markus Hähnel
A Stochastic Bin Packing Approach for Server Consolidation with Conflicts. OR 2019: 159-165 - 2018
- [j38]John Martinovic
Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case. Ann. Oper. Res. 271(2): 811-829 (2018) - [j37]John Martinovic, Guntram Scheithauer:
The skiving stock problem and its relation to hypergraph matchings. Discret. Optim. 29: 77-102 (2018) - [j36]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): 458-471 (2018) - [j35]Marcus Hähnel
Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads. IEEE Trans. Parallel Distributed Syst. 29(11): 2478-2488 (2018) - [c9]John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer:
An Improved Arcflow Model for the Skiving Stock Problem. OR 2018: 135-141 - 2017
- [j34]John Martinovic, Guntram Scheithauer:
An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case. Discret. Appl. Math. 229: 161-167 (2017) - [j33]John Martinovic
Integer Linear Programming Formulations for Cognitive Radio Resource Allocation. IEEE Wirel. Commun. Lett. 6(4): 494-497 (2017) - [c8]John Martinovic, Guntram Scheithauer:
An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case. OR 2017: 179-184 - 2016
- [j32]John Martinovic, Guntram Scheithauer:
Integer rounding and modified integer rounding for the skiving stock problem. Discret. Optim. 21: 118-130 (2016) - [j31]John Martinovic, Guntram Scheithauer:
Integer linear programming models for the skiving stock problem. Eur. J. Oper. Res. 251(2): 356-368 (2016) - [j30]Torsten Buchwald, Guntram Scheithauer:
Upper bounds for heuristic approaches to the strip packing problem. Int. Trans. Oper. Res. 23(1-2): 93-119 (2016) - [j29]John Martinovic, Guntram Scheithauer:
The proper relaxation and the proper gap of the skiving stock problem. Math. Methods Oper. Res. 84(3): 527-548 (2016) - [j28]Petro I. Stetsyuk
On the global minimum in a balanced circular packing problem. Optim. Lett. 10(6): 1347-1360 (2016) - [c7]Torsten Buchwald, Guntram Scheithauer:
Creating Worst-Case Instances for Lower Bounds of the 2D Strip Packing Problem. OR 2016: 103-109 - [c6]John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer:
On the Solution of Generalized Spectrum Allocation Problems. OR 2016: 133-138 - 2015
- [j27]Vadim M. Kartak
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem. Discret. Appl. Math. 187: 120-129 (2015) - [j26]Franziska Heinicke, Axel Simroth, Guntram Scheithauer, Andreas Fischer
A railway maintenance scheduling problem with customer costs. EURO J. Transp. Logist. 4(1): 113-137 (2015) - [j25]Julia A. Bennell
Optimal clustering of a pair of irregular objects. J. Glob. Optim. 61(3): 497-524 (2015) - [c5]John Martinovic, Guntram Scheithauer:
LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap. OR 2015: 49-54 - [c4]Torsten Buchwald, Guntram Scheithauer:
Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem. OR 2015: 55-61 - [c3]Isabel Friedow, Guntram Scheithauer:
Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem. OR 2015: 71-77 - 2014
- [j24]Torsten Buchwald, Kirsten Hoffmann, Guntram Scheithauer:
Relations between capacity utilization, minimal bin size and bin number. Ann. Oper. Res. 217(1): 55-76 (2014) - [c2]Torsten Buchwald, Guntram Scheithauer:
Upper Bounds for Heuristic Approaches to the Strip Packing Problem. OR 2014: 65-70 - [c1]Isabel Friedow, Guntram Scheithauer:
New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem. OR 2014: 151-157 - 2013
- [j23]Gleb Belov
Conservative scales in packing problems. OR Spectr. 35(2): 505-542 (2013) - 2012
- [j22]M. Mesyagutov, Guntram Scheithauer, Gleb Belov
LP bounds in various constraint programming approaches for orthogonal packing. Comput. Oper. Res. 39(10): 2425-2438 (2012) - 2011
- [j21]Yu. G. Stoyan
Covering a polygonal region by rectangles. Comput. Optim. Appl. 48(3): 675-695 (2011) - 2010
- [j20]Julia A. Bennell
Tools of mathematical modeling of arbitrary object packing problems. Ann. Oper. Res. 179(1): 343-368 (2010)
2000 – 2009
- 2009
- [j19]Gleb Belov
One-dimensional relaxations and LP bounds for orthogonal packing. Int. Trans. Oper. Res. 16(6): 745-766 (2009) - 2008
- [j18]Gleb Belov
One-dimensional heuristics adapted for two-dimensional rectangular strip packing. J. Oper. Res. Soc. 59(6): 823-832 (2008) - 2007
- [j17]Gleb Belov
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting. INFORMS J. Comput. 19(1): 27-35 (2007) - 2006
- [j16]Gleb Belov
A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. Eur. J. Oper. Res. 171(1): 85-106 (2006) - 2004
- [j15]Yurij Stoyan
Phi-functions for complex 2D-objects. 4OR 2(1): 69-84 (2004) - 2002
- [j14]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): 229-245 (2002) - [j13]Gleb Belov
A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Eur. J. Oper. Res. 141(2): 274-294 (2002) - [j12]Yurij Stoyan, Johannes Terno, Guntram Scheithauer, Nikolay Gil, Tatiana E. Romanova:
Phi-functions for primary 2D-objects. Stud. Inform. Univ. 2(1): 1-32 (2002) - 2001
- [j11]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): 1390-1401 (2001) - 2000
- [j10]Johannes Terno, Guntram Scheithauer, Uta Sommerweiß, Jan Riehme:
An efficient approach for the multi-pallet loading problem. Eur. J. Oper. Res. 123(2): 372-381 (2000)
1990 – 1999
- 1999
- [j9]Christoph Nitsche, Guntram Scheithauer, Johannes Terno:
Tighter relaxations for the cutting stock problem. Eur. J. Oper. Res. 112(3): 654-663 (1999) - 1998
- [j8]Guntram Scheithauer, Uta Sommerweiß:
4-Block heuristic for the rectangle packing problem. Eur. J. Oper. Res. 108(3): 509-526 (1998) - [j7]Christoph Nitsche, Guntram Scheithauer, Johannes Terno:
New cases of the cutting stock problem having MIRUP. Math. Methods Oper. Res. 48(1): 105-115 (1998) - 1997
- [j6]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): 93-100 (1997) - 1994
- [j5]Guntram Scheithauer:
On the MAXGAP Problem for Cutting Stock Problems. J. Inf. Process. Cybern. 30(2): 111-117 (1994) - 1993
- [j4]Guntram Scheithauer:
Computation of Optimal ø-simple Guillotine Cutting Patterns. J. Inf. Process. Cybern. 29(2): 115-128 (1993) - 1991
- [j3]Guntram Scheithauer:
A Three-dimensional Bin Packing Algorithm. J. Inf. Process. Cybern. 27(5/6): 263-271 (1991)
1980 – 1989
- 1988
- [j2]Guntram Scheithauer, Johannes Terno:
The Partition of a Square in Rectangles with Equal Areas. J. Inf. Process. Cybern. 24(4/5): 189-200 (1988) - 1985
- [j1]Guntram Scheithauer:
Rekursive Berechnung von Minimalgerüsten für spezielle Subgrahen. J. Inf. Process. Cybern. 21(12): 613-624 (1985) - 1983
- [b1]Guntram Scheithauer:
Äquivalenz, Symmetrie und Rekursivität bei Branch-and-Bound-Verfahren am Beispiel des Traveling-Salesman-Problem. Dresden University of Technology, Germany, 1983
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: