The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.disopt.2016.04.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2406503936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum connected dominating sets and maximal independent sets in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weakly connected domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independent dominating set polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection, lifting and extended formulation integer and combinatorial optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:07, 15 July 2024

scientific article
Language Label Description Also known as
English
The minimum weakly connected independent set problem: polyhedral results and branch-and-cut
scientific article

    Statements

    The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    weakly connected independent set
    0 references
    polytopes
    0 references
    valid inequalities
    0 references
    graph operations
    0 references
    branch-and-cut
    0 references

    Identifiers