The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
From MaRDI portal
(Redirected from Publication:2056893)
Recommendations
Cites work
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- A tutorial on branch and cut algorithms for the maximum stable set problem
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Bounded Stable Sets: Polytopes and Colorings
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- Finding a Maximum Clique in an Arbitrary Graph
- scientific article; zbMATH DE number 956849 (Why is no real title available?)
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Non delayed relax-and-cut algorithms
- Paths, trees and matchings under disjunctive constraints
- Properties of vertex packing and independence system polyhedra
Cited in
(3)
This page was built for publication: The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056893)