Parallel local search for Steiner trees in graphs (Q1808193): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OR-Library / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / 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.1023/a:1018908614375 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W198341110 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:36, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel local search for Steiner trees in graphs |
scientific article |
Statements
Parallel local search for Steiner trees in graphs (English)
0 references
2 December 1999
0 references
Steiner tree problem
0 references
traveling salesman problem
0 references
parallel local search algorithm
0 references
multiple-step parallelism
0 references
