Two-dimensional packing: expected performance of simple level algorithms

DOI10.1016/S0019-9958(80)90817-7MaRDI QIDQ3885779zbMATH OpenFDO

Authors Micha Hofri

Publication date 1980

Published in Information and Control (Search for Journal in Brave)

zbMATH Keywords

simulationuniform distributionbin packinganalysisexpected performanceFORMAClevel algorithmsnext fit decreasingtwo dimensional packingwaste ratio

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited in

(12)

• Optimization of Priority Class Queues, with a Computer Center Case Study
• Fuzzy bin packing problem.
• A two-phase heuristic for strip packing: Algorithm and probabilistic analysis
• Average-case analysis of cutting and packing in two dimensions
• The nesting problem in the leather manufacturing industry
• Efficient heuristics for robot acquisition planning for a CIM system
• Expected performance of the shelf heuristic for 2-dimensional packing
• Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
• Exact algorithms for the guillotine strip cutting/packing problem.
• Packing problems
• Multiple-type, two-dimensional bin packing problems: Applications and algorithms
• Packings in two dimensions: Asymptotic average-case analysis of algorithms

Describes a project that uses

Uses Software

• FORMAC

This page was built for publication: Two-dimensional packing: expected performance of simple level algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885779)