The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs (Q2766100): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199910)34:3<181::aid-net2>3.0.co;2-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051892429 / rank | |||
Normal rank | |||
| Property / title | |||
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs (English) | |||
| Property / title: The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs (English) / rank | |||
Normal rank | |||
Latest revision as of 10:55, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs |
scientific article |
Statements
27 January 2002
0 references
metaheuristic
0 references
Steiner problem
0 references
weighted graph
0 references
0 references
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs (English)
0 references
