scientific article
From MaRDI portal
Publication:3145801
zbMath1253.90191MaRDI QIDQ3145801
Gábor Galambos, Silvano Martello, Edward G. jun. Coffman, Daniele Vigo
Publication date: 23 December 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
Semi-on-line bin packing: a short overview and a new lower bound ⋮ Dynamic bin packing of unit fractions items ⋮ Procedures for the bin packing problem with precedence constraints ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Space and time allocation in a shipyard assembly hall ⋮ Routing problems with loading constraints ⋮ Lower and upper bounds for the bin packing problem with fragile objects ⋮ Online bin packing of fragile objects with application in cellular networks ⋮ Two-machine flowshop scheduling with intermediate transportation under job physical space consideration ⋮ On-line bin packing with restricted repacking ⋮ Station assignment with reallocation ⋮ The optimal absolute ratio for online bin packing ⋮ Online bin packing with arbitrary release times ⋮ Selfish bin packing ⋮ Batched bin packing ⋮ Improved lower bounds for semi-online bin packing problems ⋮ On dynamic bin packing: An improved lower bound and resource augmentation analysis ⋮ New lower bounds for the three-dimensional finite bin packing problem ⋮ A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times ⋮ Bin Packing with Queues ⋮ Heuristic algorithms for the three-dimensional bin packing problem
This page was built for publication:
