A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Connected bin packing problem on traceable graphs
2022
Iranian journal of numerical analysis and optimization
We consider a new extension of the bin packing problem in which a set of connectivity constraints should be satisfied. An undirected graph with a weight function on the nodes is given. The objective is to pack all the nodes in the minimum number of unit-capacity bins, such that the induced subgraph on the set of nodes packed in each bin is connected. After analyzing some structural properties of the problem, we present a linear time approximation algorithm for this problem when the underlying
doi:10.22067/ijnao.2021.67913.1010
doaj:4f3fe01ed77b4c8d87a8f6b817f43626
fatcat:iljmepolszhqzlhykwbwstakka