Bin packing problems in one dimension: Heuristic solutions and confidence intervals

DOI10.1016/0305-0548(88)90009-3zbMath0636.90060OpenAlexW2053125860MaRDI QIDQ1098774

Roland D. Kankey, Nicholas G. Hall, Sridhar Narasimhan, Soumen Ghosh, WanSoo T. Rhee

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90009-3

zbMATH Keywords

confidence intervalsone-dimensional bin packingheuristic methodsrandomly generated problemsinterval estimation procedurelarge-scale computational studyprespecified optimal values

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Boolean programming (90C09)

Related Items

A nonidentical parallel processor scheduling problem ⋮ Exact and approximate methods for a one-dimensional minimax bin-packing problem ⋮ Bin packing problem with conflicts and item fragmentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
• Fast algorithms for bin packing
• An efficient heuristic for large set covering problems
• Probabilistic Analysis of Bin Packing Heuristics
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
• Interval estimation of a global optimum for large combinatorial problems
• The Loading Problem

This page was built for publication: Bin packing problems in one dimension: Heuristic solutions and confidence intervals