A heuristic algorithm for the Bin Packing Problem with Conflicts on Interval Graphs (Q6288577)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A heuristic algorithm for the Bin Packing Problem with Conflicts on Interval Graphs |
scientific article; zbMATH DE number 900320110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic algorithm for the Bin Packing Problem with Conflicts on Interval Graphs |
scientific article; zbMATH DE number 900320110 |
Statements
3 July 2017
0 references
math.CO
0 references
cs.DS
0 references
