Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1392563
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Manoel B. Campêlo / rank
 
Normal rank

Revision as of 15:47, 27 February 2024

scientific article
Language Label Description Also known as
English
Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
scientific article

    Statements

    Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    min-degree constrained minimum spanning tree problem
    0 references
    integer programming
    0 references
    Lagrangian heuristic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references