Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (Q4894856): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3948568 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4692508 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4079017 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4764186 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4385515 / rank | |||
Normal rank | |||
Latest revision as of 13:42, 24 May 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
