A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Manoel B. Campêlo / rank
Normal rank
 
Property / author
 
Property / author: Manoel B. Campêlo / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6596262 / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum stable set
Property / zbMATH Keywords: maximum stable set / rank
 
Normal rank
Property / zbMATH Keywords
 
integer programming
Property / zbMATH Keywords: integer programming / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.05.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W626430230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymmetric representatives formulation for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-weight stable sets and safe lower bounds for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:38, 12 July 2024

scientific article
Language Label Description Also known as
English
A polyhedral study of the maximum stable set problem with weights on vertex-subsets
scientific article

    Statements