Similar Search Results

Upper bounds for heuristic approaches to the strip packing problem

Buchwald, Torsten; Scheithauer, Guntram - In: International transactions in operational research : … 23 (2016) 1/2, pp. 93-119

Persistent link: https://www.econbiz.de/10011483279

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

Martinovic, John; Hähnel, Markus; Scheithauer, Guntram; … - In: 4OR : a quarterly journal of operations research 17 (2019) 2, pp. 173-200

Persistent link: https://www.econbiz.de/10012007904

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

Martinovic, J.; Scheithauer, Guntram; Carvalho, José … - In: European journal of operational research : EJOR 266 (2018) 2, pp. 458-471

Persistent link: https://www.econbiz.de/10011811790

Integer linear programming models for the skiving stock problem

Martinovic, John; Scheithauer, Guntram - In: European journal of operational research : EJOR 251 (2016) 2, pp. 356-368

Persistent link: https://www.econbiz.de/10011444324

LP bounds in various constraint programming approaches for orthogonal packing

Mesyagutov, Marat; Scheithauer, Guntram; Belov, Gleb - In: Computers & operations research : and their … 39 (2012) 10, pp. 2425-2438

Persistent link: https://www.econbiz.de/10009510254

Conservative scales in packing problems

Belov, Gleb; Kartak, V. M.; Rohling, H.; Scheithauer, … - In: OR spectrum : quantitative approaches in management 35 (2013) 2, pp. 505-542

Persistent link: https://www.econbiz.de/10009717163

Tools of mathematical modeling of arbitrary object packing problems

Bennell, J. A.; Scheithauer, Guntram; Stoyan, Y.; … - 2010

Persistent link: https://www.econbiz.de/10008655085

One-dimensional relaxations and LP bounds for orthogonal packing

Belov, Gleb; Kartak, Vadin; Rohling, Heide; … - In: International transactions in operational research : … 16 (2009) 6, pp. 745-766

Persistent link: https://www.econbiz.de/10003908883

Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem

Kartak, Vadim - 2014

We consider the well-known one dimensional cutting stock problem (1CSP). Based on the pattern structure of the classical ILP formulation of Gilmore and Gomory, we can decompose the infinite set of 1CSP instances, with a fixed demand n, into a finite number of equivalence classes. We show up a...

Persistent link: https://www.econbiz.de/10013053629

An introduction to stochastic bin packing-based server consolidation with conflicts

Martinovic, John; Hähnel, Markus; Scheithauer, Guntram; … - In: Top : an official journal of the Spanish Society of … 30 (2022) 2, pp. 296-331

Persistent link: https://www.econbiz.de/10013274127