The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope

DOI10.1007/978-3-030-63072-0_9zbMath1481.90279OpenAlexW3134738845MaRDI QIDQ2056893

Phillippe Samer, Dag Haugland

Publication date: 8 December 2021

Full work available at URL: https://hdl.handle.net/11250/2761120

zbMATH Keywords

integer programmingcombinatorial optimizationvalid inequalitiesindependent setscardinality constraintsstable sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Integer programming (90C10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Paths, trees and matchings under disjunctive constraints
• Non delayed relax-and-cut algorithms
• Efficient cuts in Lagrangean `relax-and-cut' schemes
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A branch and cut algorithm for minimum spanning trees under conflict constraints
• Mathematical programming based heuristics for the 0--1 MIP: a survey
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Finding a Maximum Clique in an Arbitrary Graph
• Bounded Stable Sets: Polytopes and Colorings
• Properties of vertex packing and independence system polyhedra
• A tutorial on branch and cut algorithms for the maximum stable set problem