A novel genetic algorithm for solving the clustered shortest-path tree problem (Q3384537): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q113999585 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.37193/cjm.2020.03.08 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3134634344 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:31, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A novel genetic algorithm for solving the clustered shortest-path tree problem |
scientific article |
Statements
A novel genetic algorithm for solving the clustered shortest-path tree problem (English)
0 references
15 December 2021
0 references
single-source shortest-path problem
0 references
clustered shortest-path tree problem
0 references
genetic algorithms
0 references
