Publication:3805803
From MaRDI portal
zbMath0657.65089MaRDI QIDQ3805803
Guntram Scheithauer, Johannes Terno, Rudolf Lindemann
Publication date: 1987
variance analysis; simulation; computer aided design; dynamical optimization; simplex method; Knapsack problem; branch and bound method; sequential ordering; computer realization
65K05: Numerical mathematical programming methods
65C20: Probabilistic models, generic numerical methods in probability and statistics
65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis
65D15: Algorithms for approximation of functions
Related Items
The modified integer round-up property of the one-dimensional cutting stock problem, Solving sequential interval cutting problems via dynamic programming, On genetic algorithms for the packing of polygons, The solution of two-stage guillotine cutting stock problems having extremely varying order demands, 4-block heuristic for the rectangle packing problem, On convex partitions of polygonal regions, On the effectivity of gradient methods for cutting stock problems, Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem, An efficient approach for the multi-pallet loading problem, Tighter relaxations for the cutting stock problem, A typology of cutting and packing problems, A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths, A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry, The nesting problem in the leather manufacturing industry, Cutting aluminium coils with high length variabilities, Guillotine cutting of defective boards
