A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410)
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 general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing |
scientific article; zbMATH DE number 5544751
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing |
scientific article; zbMATH DE number 5544751 |
Statements
A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (English)
0 references
17 April 2009
0 references
metaheuristics
0 references
packing
0 references
graph colouring
0 references
grouping problems
0 references
0 references
0 references
0 references
