Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (Q4894856): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:39, 8 February 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
