scientific article
From MaRDI portal
Publication:3805803
zbMath0657.65089MaRDI QIDQ3805803
Guntram Scheithauer, Rudolf Lindemann, Johannes Terno
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
variance analysissimulationcomputer aided designdynamical optimizationsimplex methodKnapsack problembranch and bound methodsequential orderingcomputer realization
Numerical mathematical programming methods (65K05) Probabilistic models, generic numerical methods in probability and statistics (65C20) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Algorithms for approximation of functions (65D15)
Related Items
On the effectivity of gradient methods for cutting stock problems, The nesting problem in the leather manufacturing industry, Cutting aluminium coils with high length variabilities, Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem, The modified integer round-up property of the one-dimensional cutting stock problem, Exact approaches for the unconstrained two-dimensional cutting problem with defects, Guillotine cutting of defective boards, The Meet-in-the-Middle Principle for Cutting and Packing Problems, Cutting and Packing Problems with Placement Constraints, Solving sequential interval cutting problems via dynamic programming, Grids for cutting and packing problems: a study in the 2D knapsack problem, Exact solution techniques for two-dimensional cutting and packing, Tighter relaxations for the cutting stock problem, The exact solutions of several types of container loading problems, On genetic algorithms for the packing of polygons, The solution of two-stage guillotine cutting stock problems having extremely varying order demands, A typology of cutting and packing problems, An efficient approach for the multi-pallet loading problem, 4-block heuristic for the rectangle packing problem, On convex partitions of polygonal regions, 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, Enhanced formulation for the Guillotine 2D Cutting knapsack problem, The one-dimensional cutting stock problem with usable leftovers -- a survey
