Bin packing problems in one dimension: Heuristic solutions and confidence intervals
type: Item
instance of: scholarly article
title: Bin packing problems in one dimension: Heuristic solutions and confidence intervals
zbMATH Open document ID: 0636.90060
DOI: 10.1016/0305-0548(88)90009-3
author: Nicholas G. Hall
author: Soumen Ghosh
author: Roland D. Kankey
author: Sridhar Narasimhan
author: Wansoo T. Rhee
published in: Computers \& Operations Research
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4037602
zbMATH Keywords: one-dimensional bin packing
zbMATH Keywords: heuristic methods
zbMATH Keywords: confidence intervals
zbMATH Keywords: large-scale computational study
zbMATH Keywords: randomly generated problems
zbMATH Keywords: prespecified optimal values
zbMATH Keywords: interval estimation procedure
MaRDI profile type: Publication
full work available at URL: 0305-0548(88)90009-3
OpenAlex ID: W2053125860
cites work: The Loading Problem
cites work: Q5685847
cites work: Q4131987
cites work: Fast algorithms for bin packing
cites work: Q4142699
cites work: Q4198056
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Probabilistic Analysis of Bin Packing Heuristics
cites work: Interval estimation of a global optimum for large combinatorial problems
cites work: An efficient heuristic for large set covering problems
cites work: On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
cites work: Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
cites work: Q3347319
cites work: Q4179721
description: scientific article; zbMATH DE number 4037602