Efficient solution methods for covering tree problems (Q1284598): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximal covering tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective programming and planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hierarchical network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Direct Covering Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indirect covering tree problems on spanning tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum length covering subgraph of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum-length covering subtree of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The location of central structures in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of extensive facility location in networks / rank
 
Normal rank

Latest revision as of 19:37, 28 May 2024

scientific article
Language Label Description Also known as
English
Efficient solution methods for covering tree problems
scientific article

    Statements

    Efficient solution methods for covering tree problems (English)
    0 references
    0 references
    0 references
    0 references
    26 April 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    location
    0 references
    maximal direct and indirect covering tree problems
    0 references
    NP-hard
    0 references