scientific article; zbMATH DE number 3423800

zbMath0268.90034MaRDI QIDQ5685847

No author found.

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Operations research and management science (90B99) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Software, source code, etc. for problems pertaining to combinatorics (05-04) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to convex and discrete geometry (52-01)

Related Items

A 71/60 theorem for bin packing, Bin packing problems in one dimension: Heuristic solutions and confidence intervals, Effective methods for a container packing operation, One-dimensional stock cutting: optimization of usable leftovers in consecutive orders, CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem, On-line bin packing ? A restricted survey, Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers, A system‐level optimization framework for efficiency and effectiveness improvement of wastewater treatment plants, Relaxation techniques applied to some loading problems, Parameterized complexity of strip packing and minimum volume packing, Physical simulation of a three dimensional palletizing heuristic, The complexity of scheduling TV commercials, Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, A typology of cutting and packing problems, Fast algorithms for bin packing, Convergence of optimal stochastic bin packing, The one-dimensional cutting stock problem with usable leftovers -- a survey