Models and algorithms for the weighted safe set problem

DOI10.1016/j.dam.2022.12.022OpenAlexW4313241589MaRDI QIDQ2686129

Vagner Pedrotti, Enrico Malaguti

Publication date: 24 February 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.12.022

zbMATH Keywords

branch-and-cut algorithmcomputational experimentssafe set problemweighted safe set problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx) Operations research and management science (90Bxx)

Related Items (1)

Constructive-destructive heuristics for the safe set problem

Uses Software

• SCIP
• k-Vertex-Cut-Problem

Cites Work

• Safe set problem on graphs
• Network majority on tree topological network
• Safe sets in graphs: graph classes and structural parameters
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Multi-neighborhood tabu search for the maximum weight clique problem
• On integer and bilevel formulations for the \(k\)-vertex cut problem
• A compact mixed integer linear formulation for safe set problems
• A new formulation for the safe set problem on graphs
• On the minimum cut separator problem
• Parameterized Complexity of Safe Set

This page was built for publication: Models and algorithms for the weighted safe set problem