Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (Q4894856)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 932499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9004117250442505
0 references
