Steiner problem in networks: A survey (Q3790913): 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 / 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.3230170203 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2172222998 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126263634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3042417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight two-connected spanning networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in Halin networks / rank
 
Normal rank

Latest revision as of 16:41, 18 June 2024

scientific article
Language Label Description Also known as
English
Steiner problem in networks: A survey
scientific article

    Statements

    Steiner problem in networks: A survey (English)
    0 references
    0 references
    0 references
    1987
    0 references
    Lagrangean relaxation
    0 references
    dual ascent
    0 references
    probabilistic networks
    0 references
    minimum cost connected network
    0 references
    weighted graph
    0 references
    Steiner problem in networks
    0 references
    survey
    0 references
    exact algorithms
    0 references
    heuristics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references