Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (Q4894856): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230260403 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2163210218 / rank | |||
Normal rank | |||
Revision as of 19:55, 19 March 2024
scientific article; zbMATH DE number 932499
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm |
scientific article; zbMATH DE number 932499 |
Statements
Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (English)
0 references
3 February 1997
0 references
genetic algorithm
0 references
Steiner problem in a graph
0 references
branch-and-cut algorithms
0 references
heuristic
0 references
