Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5294075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regenerator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. II: Properties and classes of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds and Algorithms for Dominating Sets in Web Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum leaf spanning tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum-leaf spanning tree problem: Formulations and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations and solution algorithms for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees and Cuts / 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: On positive influence dominating sets in social networks / rank
 
Normal rank

Latest revision as of 14:13, 9 July 2024

scientific article
Language Label Description Also known as
English
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
scientific article

    Statements

    Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (English)
    0 references
    0 references
    0 references
    0 references
    26 January 2015
    0 references
    connected dominating sets
    0 references
    valid inequalities
    0 references
    Benders decomposition
    0 references
    branch and cut
    0 references

    Identifiers