A new destructive bounding scheme for the bin packing problem
type: Item
instance of: scholarly article
title: A new destructive bounding scheme for the bin packing problem
zbMATH Open document ID: 1203.90133
author: Bassem Jarboui
author: Saber Ibrahim
author: Abdelwaheb Rebaï
published in: Annals of Operations Research
publication date: 2010-12-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5826008
zbMATH Keywords: bin packing
zbMATH Keywords: lower bounds
zbMATH Keywords: destructive bounds
describes a project that uses: Bison
MaRDI profile type: Publication
full work available at URL: s10479-008-0459-2
OpenAlex ID: W2061961069
cites work: The two-dimensional finite bin packing problem. II: New lower and upper bounds
cites work: An analysis of lower bound procedures for the bin packing problem
cites work: New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
cites work: An improved lower bound for the bin packing problem
cites work: Computing the asymptotic worst-case of bin packing lower bounds
cites work: New bin packing fast lower bounds
cites work: Optimal Scheduling of Tasks on Identical Parallel Processors
cites work: Ranking lower bounds for the bin-packing problem
cites work: New classes of fast lower bounds for bin packing problems
cites work: Q4198056
cites work: Fast lifting procedures for the bin packing problem
cites work: Capacitated Vehicle Routing on Trees
cites work: Q3993418
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study
cites work: An improved typology of cutting and packing problems
DOI: 10.1007/S10479-008-0459-2
description: scientific article; zbMATH DE number 5826008