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

@article{Sadykov2013BinPW,
  title={Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm},
  author={Ruslan Sadykov and François Vanderbeck},
  journal={INFORMS Journal on Computing},
  year={2013},
  volume={25},
  pages={244-255}
}
The bin packing problem with conflicts consists in 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… CONTINUE READING
28 Extracted Citations
25 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 28 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 25 references

Knapsack problems

  • Kelleler, Hans, Ulrich Pferschy, David Pisinger.
  • Springer-Verlag Berlin.
  • 2004
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…