Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4845363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SST-based algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving group Steiner problems as Steiner problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several formulations for the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the History of the Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class Steiner trees and VLSI-design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally and locally minimal weight spanning tree networks / 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
Property / cites work
 
Property / cites work: The full Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—Genetic Algorithms for the Operations Researcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided local search and its application to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank

Revision as of 11:02, 24 June 2024

scientific article
Language Label Description Also known as
English
Upper and lower bounding strategies for the generalized minimum spanning tree problem
scientific article

    Statements

    Upper and lower bounding strategies for the generalized minimum spanning tree problem (English)
    0 references
    0 references
    16 March 2006
    0 references
    generalized minimum spanning tree
    0 references
    Steiner tree
    0 references
    randomized greedy heuristic
    0 references
    genetic algorithm
    0 references
    Lagrangian relaxation
    0 references

    Identifiers