Abstract
We consider the classical One-Dimensional Bin Packing Problem (1D-BPP), an NP-hard optimization problem, where, a set of weighted items has to be packed into one or more identical capacitated bins. We give an experimental study on using symmetry breaking constraints for strengthening the classical integer linear programming proposed to optimally solve this problem. Our computational experiments are conducted on the data-sets found in BPPLib and the results have confirmed the theoretical results.
Cite
CITATION STYLE
Salem, K. H., & Kieffer, Y. (2020). An Experimental Study on Symmetry Breaking Constraints Impact for the One Dimensional Bin-Packing Problem. In Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, FedCSIS 2020 (pp. 317–326). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.15439/2020F19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
