A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4735941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / 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: Q4747150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new trust region technique for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the separation of maximally violated mod-\(k\) cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wheel inequalities for stable set polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antiweb-wheel inequalities and their separation problems over the stable set polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for graph coloring and maximal clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices with the Edmonds-Johnson property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the relationship between max-cut and stable set relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Characterizations of the Maximum Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly bipartite graphs and the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using cutting planes to solve the symmetric Travelling Salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / 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: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test case generators and computational results for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization approach for solving the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut solver 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price approach for the maximum weight independent set problem / rank
 
Normal rank

Latest revision as of 10:04, 6 July 2024

scientific article; zbMATH DE number 6156981
Language Label Description Also known as
English
A tutorial on branch and cut algorithms for the maximum stable set problem
scientific article; zbMATH DE number 6156981

    Statements

    A tutorial on branch and cut algorithms for the maximum stable set problem (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2013
    0 references
    0 references
    branch and cut
    0 references
    clique
    0 references
    cutting plane
    0 references
    separation
    0 references
    stable set
    0 references
    stable set polytope
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references