( en | de | ru )

 

Disambiguation of "Scheithauer, Guntram"

Author of the publication

copydeleteadd this publication to your clipboard
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm.

, , , and . J. Oper. Res. Soc., 52 (12): 1390-1401 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Guntram Scheithauer

Margot Scheithauer

Gerburg Scheithauer

Georg Scheithauer

Walter Scheithauer

 

Other publications of authors with the same name

Improved flow-based formulations for the skiving stock problem., , , , and . Comput. Oper. Res., (2020)Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation., , , , and . 4OR, 17 (2): 173-200 (2019)LP bounds in various constraint programming approaches for orthogonal packing., , and . Comput. Oper. Res., 39 (10): 2425-2438 (2012)An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case., and . Discret. Appl. Math., (2017)A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs., , and . EURO J. Comput. Optim., (2021)Conservative scales in packing problems., , , and . OR Spectrum, 35 (2): 505-542 (2013)An Improved Arcflow Model for the Skiving Stock Problem., , , and . OR, page 135-141. Springer, (2018)Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm., , , and . J. Oper. Res. Soc., 52 (12): 1390-1401 (2001)Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles., , , and . Discret. Optim., (2021)A Stochastic Bin Packing Approach for Server Consolidation with Conflicts., , , and . OR, page 159-165. Springer, (2019)