The following pages link to Guntram Scheithauer (Q315514):
Displaying 50 items.
- On the global minimum in a balanced circular packing problem (Q315515) (← links)
- Integer linear programming models for the skiving stock problem (Q322686) (← links)
- Packing unequal spheres into various containers (Q334249) (← links)
- Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
- The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
- (Q664175) (redirect page) (← links)
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution (Q664176) (← links)
- On the stochastic complexity of the asymmetric traveling salesman problem (Q915656) (← links)
- Cutting and packing optimization. Problems modeling and solution methods. (Q931915) (← links)
- The modified integer round-up property of the one-dimensional cutting stock problem (Q1127208) (← links)
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands (Q1278246) (← links)
- 4-block heuristic for the rectangle packing problem (Q1296784) (← links)
- New cases of the cutting stock problem having MIRUP (Q1298738) (← links)
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem (Q1376328) (← links)
- An efficient approach for the multi-pallet loading problem (Q1569940) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods (Q1708742) (← links)
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
- Integer rounding and modified integer rounding for the skiving stock problem (Q1751167) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
- Tighter relaxations for the cutting stock problem (Q1806682) (← links)
- \(\Phi\)-functions for complex 2D-objects (Q1878997) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles (Q2042074) (← links)
- An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem (Q2348062) (← links)
- Mathematical modeling of interactions of primary geometric 3D objects (Q2508764) (← links)
- (Q2712306) (← links)
- Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
- Upper Bounds for Heuristic Approaches to the Strip Packing Problem (Q2806895) (← links)
- New Inequalities for 1D Relaxations of the 2D Rectangular Strip Packing Problem (Q2806912) (← links)
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting (Q2892308) (← links)
- (Q3492274) (← links)
- On recursive computation of minimum spanning trees for special partial graphs (Q3690607) (← links)
- Complexity investigations on the ellipsoid algorithm (Q3738924) (← links)
- (Q3741632) (← links)
- (Q3745624) (← links)
- (Q3775350) (← links)
- Guillotine cutting of defective boards (Q3789318) (← links)
- (Q3805803) (← links)
- (Q3806276) (← links)
- Modeling of packing problems (Q3835624) (← links)
- A new extension principle algorithm for the traveling salesman problem (Q3962804) (← links)
- A note on handling residual lengths (Q3974424) (← links)
- (Q3980375) (← links)
- (Q3989344) (← links)
- (Q4034195) (← links)
