A compact mixed integer linear formulation for safe set problems (Q2228393): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Safe sets in graphs: graph classes and structural parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for a class of critical node problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting critical nodes in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separator problem: a polyhedral investigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network majority on tree topological network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe sets, network majority on weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-separator problem: polyhedra, complexity and approximation results / 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: The vertex \(k\)-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of positive influence dominating set in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe set problem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The critical node detection problem in networks: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation for the safe set problem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions / 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: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming framework for critical elements detection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive Influence Dominating Set in Online Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Revision as of 14:28, 24 July 2024

scientific article
Language Label Description Also known as
English
A compact mixed integer linear formulation for safe set problems
scientific article

    Statements

    A compact mixed integer linear formulation for safe set problems (English)
    0 references
    0 references
    17 February 2021
    0 references
    graph partitioning
    0 references
    network control
    0 references
    safe set
    0 references
    connected safe set
    0 references
    mixed integer linear programming
    0 references
    symmetry-breaking
    0 references
    variable reduction
    0 references

    Identifiers