The node-weighted steiner tree problem (Q3789370): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.3230170102 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140951480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184789 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:30, 18 June 2024

scientific article
Language Label Description Also known as
English
The node-weighted steiner tree problem
scientific article

    Statements

    The node-weighted steiner tree problem (English)
    0 references
    0 references
    0 references
    1987
    0 references
    node-weighted Steiner triple tree problem
    0 references
    node-associated weights
    0 references
    NP- complete
    0 references
    heuristic procedures
    0 references
    Lagrangian relaxation
    0 references
    subgradient optimization
    0 references
    tight lower bounds
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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