A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3104695357 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.1424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict analysis in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict graphs in solving integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / 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: Paths, trees and matchings under disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices with the Edmonds-Johnson property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum cost perfect matching problem with conflict pair constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering, Packing and Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knapsack Problem with Conflict Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum flow problem with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on branch and cut algorithms for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the maximum cardinality stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case time complexity for generating all maximal cliques and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum spanning tree problem with conflict constraints and its variations / rank
 
Normal rank

Latest revision as of 17:15, 9 July 2024

scientific article
Language Label Description Also known as
English
A branch and cut algorithm for minimum spanning trees under conflict constraints
scientific article

    Statements

    A branch and cut algorithm for minimum spanning trees under conflict constraints (English)
    0 references
    0 references
    0 references
    23 February 2015
    0 references
    optimal trees
    0 references
    conflict constraints
    0 references
    stable set
    0 references
    branch and cut
    0 references

    Identifiers