Skip to Main content Skip to Navigation
Conference papers

A dominance criterion for packing problems

Michaël Gabay 1, * Hadrien Cambazard 1 Yohann Benchetrit 2
* Corresponding author
1 G-SCOP_ROSP - Recherche Opérationnelle pour les Systèmes de Production
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
2 G-SCOP_OC - Optimisation Combinatoire
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
Abstract : We present an algorithm which we use to identify easy subproblems for packing problems. The algorithm is polynomial in the number of bins and item types and is based on a flow computation in a bipartite compat- ibility graph. It outputs the largest subproblem satisfying the dominance criterion and a feasible solution to this subproblem. The algorithm is well suited to be integrated in a branch-and-bound solver for packing problems and can be adapted to work on many problems, including single or multi-dimensionnal bin packing, vector packing, cutting stock, packing with conflicts, etc.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01027784
Contributor : Michaël Gabay <>
Submitted on : Tuesday, July 22, 2014 - 12:18:43 PM
Last modification on : Friday, April 24, 2020 - 9:54:50 AM

Identifiers

  • HAL Id : hal-01027784, version 1

Citation

Michaël Gabay, Hadrien Cambazard, Yohann Benchetrit. A dominance criterion for packing problems. IFORS 2014 - 20th Conference of the International Federation of Operational Research Societies, Jul 2014, Barcelone, Spain. ⟨hal-01027784⟩

Share

Metrics

Record views

809