Algorithms for the Bin Packing Problem with Conflicts

Authors:
Albert E. Fernandes Muritiba;Manuel Iori;Enrico Malaguti;Paolo Toth
Affiliations:
Department of Electronics, Computer Sciences and Systems, University of Bologna, 40136 Bologna, Italy;Department of Science and Methods of Engineering, University of Modena and Reggio Emilia, 42100 Reggio Emilia, Italy;Department of Electronics, Computer Sciences and Systems, University of Bologna, 40136 Bologna, Italy;Department of Electronics, Computer Sciences and Systems, University of Bologna, 40136 Bologna, Italy
Venue:
INFORMS Journal on Computing
Year:
2010

Citing 13
Cited 8

Examination timetabling by computer

Computers and Operations Research
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Bounded vertex colorings of graphs

Discrete Mathematics
Mutual exclusion scheduling

Theoretical Computer Science
Approximation algorithms for time constrained scheduling

Information and Computation
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Journal of the ACM (JACM)
Lower bounds and algorithms for the 2-dimensional vector packing problem

Discrete Applied Mathematics
On the Complexity of Scheduling Incompatible Jobs with Unit-Times

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Heuristics and lower bounds for the bin packing problem with conflicts

Computers and Operations Research
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems

INFORMS Journal on Computing
A Metaheuristic Approach for the Vertex Coloring Problem

INFORMS Journal on Computing
Models and heuristic algorithms for a weighted vertex coloring problem

Journal of Heuristics
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts

Computers and Operations Research
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts

INFORMS Journal on Computing
The min-conflict packing problem

Computers and Operations Research
New models for the Mirrored Traveling Tournament Problem

Computers and Industrial Engineering
The Bin Packing Problem with Precedence Constraints

Operations Research
The Bin Packing Problem with Precedence Constraints

Operations Research
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm

INFORMS Journal on Computing
Lower and upper bounds for the Bin Packing Problem with Fragile Objects

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a particular bin packing problem in which some pairs of items may be in conflict and cannot be assigned to the same bin. The problem, denoted as the bin packing problem with conflicts, is of practical and theoretical interest because of its many real-world applications and because it generalizes both the bin packing problem and the vertex coloring problem. We present new lower bounds, upper bounds, and an exact approach, based on a set covering formulation solved through a branch-and-price algorithm. We investigate the behavior of the proposed procedures by means of extensive computational results on benchmark instances from the literature.