Neural and delay based heuristics for the Steiner problem in networks (Q1296029): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126436855, #quickstatements; #temporary_batch_1722493470212
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing to Multiple Destinations in Computer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding paths with multiple constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of nearly minimal Steiner trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical version of Lee's multicast switch architecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126436855 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:27, 1 August 2024

scientific article
Language Label Description Also known as
English
Neural and delay based heuristics for the Steiner problem in networks
scientific article

    Statements

    Neural and delay based heuristics for the Steiner problem in networks (English)
    0 references
    0 references
    1 April 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    neural networks
    0 references
    random neural network model
    0 references
    optimization
    0 references
    multicase communication
    0 references
    multipoint routing
    0 references
    Steiner trees
    0 references
    constrained Steiner trees
    0 references
    ATM networks
    0 references
    0 references