Constructive-destructive heuristics for the safe set problem

DOI10.1016/J.COR.2023.106311MaRDI QIDQ6047845zbMATH OpenOpenAlexFDO

Authors Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins

Publication date 13 September 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.cor.2023.106311

zbMATH Keywords

graph partitioninggreedy randomized adaptive search procedurelarge neighbourhood searchsafe set problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A combinatorial branch and bound for the safe set problem
• Models and algorithms for the weighted safe set problem
• A new formulation for the safe set problem on graphs
• Safe sets, network majority on weighted trees
• A compact mixed integer linear formulation for safe set problems

Cites work

• A compact mixed integer linear formulation for safe set problems
• A new formulation for the safe set problem on graphs
• A probabilistic heuristic for a computationally difficult set covering problem
• Collective dynamics of `small-world' networks
• First vs. best improvement: an empirical study
• Models and algorithms for the weighted safe set problem
• Multiple Comparisons Among Means
• Network majority on tree topological network
• Parameterized complexity of safe set
• Safe set problem on graphs
• Safe sets in graphs: graph classes and structural parameters
• Stochastic local search. Foundations and applications.

Cited in

(3)

• Safety property-driven stubborn sets
• Safe sets and in-dominating sets in digraphs
• A combinatorial branch and bound for the safe set problem

This page was built for publication: Constructive-destructive heuristics for the safe set problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047845)