Heuristics and lower bounds for the bin packing problem with conflicts

Authors:
Michel Gendreau;Gilbert Laporte;Frédéric Semet
Affiliations:
Centre de Recherche sur les Transports and and Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, CP. 6128, Succursale Centre-ville, Montré ...;École des Hautes Études Commerciales, Montréal, Québec, Canada H3T 2A7 and LAMIH, Université de Valenciennes et du Hainaut Cambrésis, le Mont Houy, 59313 Valenciennes ...;Centre de Recherche sur les Transports, Université de Montréal, Succursale Centre-ville and École des Hautes Études Commerciales, Montréal, Québec, Canada H3T 2A7
Venue:
Computers and Operations Research
Year:
2004

Citing 8
Cited 11

Examination timetabling by computer

Computers and Operations Research
Lower bounds and reduction procedures for the bin packing problem

Discrete Applied Mathematics - Combinatorial Optimization
Bounded vertex colorings of graphs

Discrete Mathematics
Mutual exclusion scheduling

Theoretical Computer Science
Approximation algorithms for time constrained scheduling

Information and Computation
New methods to color the vertices of a graph

Communications of the ACM
Discrete Optimization Algorithms with Pascal Programs

Discrete Optimization Algorithms with Pascal Programs
On the Complexity of Scheduling Incompatible Jobs with Unit-Times

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science

A multiple container loading problem based algorithm for efficient allocation of goods to vehicles

MOAS'07 Proceedings of the 18th conference on Proceedings of the 18th IASTED International Conference: modelling and simulation
Grouping genetic algorithm for solving the serverconsolidation problem with conflicts

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
A multiple container loading problem based algorithm for efficient allocation of goods to vehicles

MS '07 The 18th IASTED International Conference on Modelling and Simulation
Algorithms for the Bin Packing Problem with Conflicts

INFORMS Journal on Computing
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
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.01

Visualization

Abstract

In the bin packing problem with conflicts, the aim is to pack items into the minimum number of bins subject to incompatibility restrictions. Two lower bounding procedures and six heuristics for this problem are developed and compared.