Examination timetabling by computer
Computers and Operations Research
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Theoretical Computer Science
Approximation algorithms for time constrained scheduling
Information and Computation
The ultimate interval graph recognition algorithm?
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Heuristics and lower bounds for the bin packing problem with conflicts
Computers and Operations Research
A new trust region technique for the maximum weight clique problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
Computers and Operations Research
Distributed Approximation Algorithm for Resource Clustering
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Mutual exclusion scheduling with interval graphs or related classes, Part I
Discrete Applied Mathematics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Algorithms for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
INFORMS Journal on Computing
Branching in branch-and-price: a generic scheme
Mathematical Programming: Series A and B
A generic view of Dantzig-Wolfe decomposition in mixed integer programming
Operations Research Letters
A note of the knapsack problem with special ordered sets
Operations Research Letters
An exact algorithm for the maximum clique problem
Operations Research Letters
| Hi-index | 0.00 |
The bin packing problem with conflicts consists of packing items in a minimum number of bins of limited capacity while avoiding joint assignments of items that are in conflict. Our study demonstrates that a generic implementation of a branch-and-price algorithm using specific pricing oracle yields comparatively good performance for this problem. We use our black-box branch-and-price solver BaPCod, relying on its generic branching scheme and primal heuristics. We developed a dynamic programming algorithm for pricing when the conflict graph is an interval graph, and a depth-first-search branch-and-bound approach for pricing when the conflict graph has no special structure. The exact method is tested on instances from the literature where the conflict graph is an interval graph, as well as harder instances that we generated with an arbitrary conflict graph and larger number of items per bin. Our computational experiment report sets new benchmark results for this problem, closing all open instances of the literature in one hour of CPU time.