Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (Q4894856): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
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
    0 references
    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 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers