An exact algorithm for the maximum stable set problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- A branch and bound algorithm for the maximum clique problem
- A note on some computationally difficult set covering problems
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
- A probabilistic heuristic for a computationally difficult set covering problem
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Algorithms on circular-arc graphs
- An exact algorithm for the maximum clique problem
- An exact algorithm for the maximum stable set problem
- An interior point algorithm to solve computationally difficult set covering problems
- Efficient algorithms for interval graphs and circular-arc graphs
- Finding a Maximum Clique in an Arbitrary Graph
- Finding maximum cliques in arbitrary and in special graphs
- New methods to color the vertices of a graph
- On maximal independent sets of vertices in claw-free graphs
- Optimization of resource location in hierarchical computer networks
- Relaxations of vertex packing
- Test case generators and computational results for the maximum clique problem
- The maximum clique problem
Cited in
(32)- scientific article; zbMATH DE number 3987328 (Why is no real title available?)
- An exact algorithm for the maximum stable set problem
- Reformulations and complexity of the clique interdiction problem by graph mapping
- Block linear majorants in quadratic 0--1 optimization
- Exact Solution Algorithms for the Chordless Cycle Problem
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
- The stable set problem and the thinness of a graph
- Combining decomposition approaches for the maximum weight stable set problem
- scientific article; zbMATH DE number 1947419 (Why is no real title available?)
- A tutorial on branch and cut algorithms for the maximum stable set problem
- A computational study of a cutting plane algorithm for university course timetabling
- Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem
- Computational study of large-scale \(p\)-median problems
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- An augmentation algorithm for the maximum weighted stable set problem
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
- Reductions for the stable set problem
- The 0-1 inverse maximum stable set problem
- A fast algorithm for the maximum weight clique problem
- A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems
- Strong lift-and-project cutting planes for the stable set problem
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Solving hard set covering problems
- A branch-and-cut algorithm for graph coloring
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Maximum weight perfect matching problem with additional disjunctive conflict constraints
- Solving a bicriteria problem of optimal service centers location
- Polynomial size IP formulations of knapsack may require exponentially large coefficients
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- scientific article; zbMATH DE number 1766756 (Why is no real title available?)
- The generalized independent set problem: polyhedral analysis and solution approaches
- Computing maximum stable sets for distance-hereditary graphs
This page was built for publication: An exact algorithm for the maximum stable set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328431)
