A linear time bin-packing algorithm

DOI10.1016/0167-6377(85)90028-8zbMath0572.90074OpenAlexW1972566466MaRDI QIDQ1062626

Charles U. Martel

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90028-8

zbMATH Keywords

cutting stocklinear time bin-packing algorithmoff-line bin-packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Related Items (3)

A 5/4 linear time bin packing algorithm ⋮ A note on the minimum bounded edge-partition of a tree ⋮ Linear time-approximation algorithms for bin packing

Cites Work

• Unnamed Item
• Unnamed Item
• A class of simple stochastic online bin packing algorithms
• Bin packing can be solved within 1+epsilon in linear time
• Time bounds for selection
• Fast algorithms for bin packing
• New Algorithms for Bin Packing

This page was built for publication: A linear time bin-packing algorithm