Heuristics and lower bounds for the bin packing problem with conflicts
type: Item
instance of: scholarly article
title: Heuristics and lower bounds for the bin packing problem with conflicts
zbMATH Open document ID: 1107.90033
DOI: 10.1016/S0305-0548(02)00195-8
author: Michel Gendreau
author: G. Laporte
author: F. Semet
published in: Computers \& Operations Research
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2137512
MaRDI profile type: Publication
cites work: An approximation scheme for bin packing with conflicts
cites work: Q3048582
cites work: Q3993418
cites work: Bounded vertex colorings of graphs
cites work: A typology of cutting and packing problems
cites work: Approximation algorithms for time constrained scheduling
cites work: Mutual exclusion scheduling
cites work: Q4260373
cites work: Q3347319
cites work: New methods to color the vertices of a graph
cites work: Approximation algorithms for combinatorial problems
cites work: Q3693257
cites work: Q5687257
cites work: Lower bounds and reduction procedures for the bin packing problem
description: scientific article; zbMATH DE number 2137512