An analysis of lower bound procedures for the bin packing problem
type: Item
instance of: scholarly article
title: An analysis of lower bound procedures for the bin packing problem
zbMATH Open document ID: 1077.90035
DOI: 10.1016/S0305-0548(03)00244-2
author: Jean-Marie Bourjolly
author: Vianney Rebetez
published in: Computers \& Operations Research
publication date: 2004-11-19T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2116894
MaRDI profile type: Publication
cites work: Q4198056
cites work: An Application of Bin-Packing to Multiprocessor Scheduling
cites work: Assembly line balancing as generalized bin packing
cites work: Branch-and-bound algorithms for the multi-product assembly line balancing problem
cites work: Capacitated Vehicle Routing on Trees
cites work: Q3347319
cites work: Lower bounds and reduction procedures for the bin packing problem
cites work: Q3993418
cites work: The Loading Problem
cites work: Optimal Scheduling of Tasks on Identical Parallel Processors
full work available at URL: s0305-0548(03)00244-2
OpenAlex ID: W2078289810
description: scientific article; zbMATH DE number 2116894