The minimum spanning tree problem with conflict constraints and its variations (Q429679): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining a Minimum Spanning Tree with Disjunctive Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for weighted matroid intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow and 2-satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matroid algorithm and its application to the efficient solution of two optimization problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Clique by Removing Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3989988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm approach on multi-criteria minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Thresholding: Improved Search by Nonmonotonic Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu thresholding implementation for the irregular stock cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A surrogate constraint tabu thresholding implementation for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank

Latest revision as of 09:37, 5 July 2024

scientific article
Language Label Description Also known as
English
The minimum spanning tree problem with conflict constraints and its variations
scientific article

    Statements

    The minimum spanning tree problem with conflict constraints and its variations (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum spanning tree
    0 references
    matroid intersection
    0 references
    conflict graphs
    0 references
    heuristics
    0 references
    combinatorial optimization
    0 references
    0 references