Models and algorithms for the weighted safe set problem
From MaRDI portal
Publication:2686129
DOI10.1016/J.DAM.2022.12.022OpenAlexW4313241589MaRDI QIDQ2686129FDOQ2686129
Authors: Enrico Malaguti, Vagner Pedrotti 
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
Recommendations
Operations research and management science (90Bxx) Graph theory (05Cxx) Mathematical programming (90Cxx)
Cites Work
- On the minimum cut separator problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- Safe set problem on graphs
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Network majority on tree topological network
- Safe sets in graphs: graph classes and structural parameters
- A new formulation for the safe set problem on graphs
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- Parameterized complexity of safe set
- A compact mixed integer linear formulation for safe set problems
Cited In (10)
- A compact mixed integer linear formulation for safe set problems
- Safe sets in graphs: graph classes and structural parameters
- Stable structure on safe set problems in vertex-weighted graphs
- A new formulation for the safe set problem on graphs
- A combinatorial branch and bound for the safe set problem
- Approximating connected safe sets in weighted trees
- On the weighted safe set problem on paths and cycles
- Constructive-destructive heuristics for the safe set problem
- Safe sets, network majority on weighted trees
- Title not available (Why is that?)
Uses Software
This page was built for publication: Models and algorithms for the weighted safe set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2686129)
