Two novel evolutionary formulations of the graph coloring problem (Q1768599): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q115434870, #quickstatements; #temporary_batch_1712111774907 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115434870 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:45, 3 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two novel evolutionary formulations of the graph coloring problem |
scientific article |
Statements
Two novel evolutionary formulations of the graph coloring problem (English)
0 references
15 March 2005
0 references
graph coloring
0 references
evolutionary algorithms
0 references
genetic algorithms
0 references
genetic programming
0 references
