Connected bin packing problem on traceable graphs
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
Ferdowsi University of Mashhad
2022-03-01
|
| Series: | Iranian Journal of Numerical Analysis and Optimization |
| Subjects: | |
| Online Access: | https://ijnao.um.ac.ir/article_40635_e5f368461d145a66208acf1635aeba83.pdf |
| Tags: |
No Tags, Be the first to tag this record!
|