Fixed cardinality stable sets
type: Item
instance of: scholarly article
title: Fixed cardinality stable sets
zbMATH Open document ID: 1477.90091
author: Phillippe Samer
author: Dag Haugland
published in: Discrete Applied Mathematics
publication date: 2021-09-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7395735
zbMATH Keywords: stable sets
zbMATH Keywords: independent sets
zbMATH Keywords: cardinality constraints
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: integer programming
zbMATH Keywords: graph classes
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: j.dam.2021.01.019
OpenAlex ID: W3127315540
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
cites work: Q3688415
cites work: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
cites work: Extended formulations for vertex cover
cites work: Parameterized Algorithms
cites work: Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
cites work: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
cites work: Determining a Minimum Spanning Tree with Disjunctive Constraints
cites work: Paths, trees and matchings under disjunctive constraints
cites work: Parameterized extension complexity of independent set and related problems
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: Mathematical programming based heuristics for the 0--1 MIP: a survey
cites work: Bounded Stable Sets: Polytopes and Colorings
cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
cites work: Non delayed relax-and-cut algorithms
cites work: The stable set problem and the thinness of a graph
cites work: Q5687256
cites work: Topics in Intersection Graph Theory
cites work: Properties of vertex packing and independence system polyhedra
cites work: A tutorial on branch and cut algorithms for the maximum stable set problem
cites work: The matching relaxation for a class of generalized set partitioning problems
cites work: Graphs and Combinatorial Optimization: from Theory to Applications
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
DOI: 10.1016/J.DAM.2021.01.019
description: scientific article; zbMATH DE number 7395735