Reducing the hierarchical network design problem (Q1121181): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The hierarchical network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the steiner problem in grapsh / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An edge elimination test for the Steiner problem in graphs / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank

Latest revision as of 14:31, 19 June 2024

scientific article
Language Label Description Also known as
English
Reducing the hierarchical network design problem
scientific article

    Statements

    Reducing the hierarchical network design problem (English)
    0 references
    0 references
    0 references
    1989
    0 references
    generalized transportation
    0 references
    Lagrangean multipliers
    0 references
    Hierarchical Network Design
    0 references
    minimum spanning tree
    0 references
    directed Steiner tree problem
    0 references
    Lagrangean relaxation
    0 references

    Identifiers