Efficient approaches for the flooding problem on graphs

DOI10.1007/S10479-018-2796-0MaRDI QIDQ2178332zbMATH OpenOpenAlexFDO

Authors André Renato Villela da Silva, Luiz S. Ochi, Bruno José da Silva Barros, Rian G. S. Pinheiro

Publication date 11 May 2020

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-018-2796-0

zbMATH Keywords

evolutionary algorithmsflooding problemGRASPiterated local searchmetaheuristicsmixed integer problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Extremal properties of flood-filling games
• Flooding games on graphs
• Flooding edge weighted graphs
• Flooding edge or node weighted graphs
• On complexity of flooding games on graphs with interval representations

Cites work

• A biased random-key genetic algorithm for the minimization of open stacks problem
• A survey of direct methods for sparse linear systems
• Exact and heuristic approaches for the cycle hub location problem
• Flooding games on graphs
• Fun with algorithms. 5th international conference, FUN 2010, Ischia, Italy, June 2--4, 2010. Proceedings
• GOAL solver: a hybrid local search based solver for high school timetabling
• GRASP: An annoted bibliography
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 6399334 (Why is no real title available?)
• Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos
• On the minimization of traffic congestion in road networks with tolls
• Parameterized complexity of flood-filling games on trees
• Probability distribution of solution time in GRASP: an experimental investigation
• The complexity of flood filling games
• The complexity of flood-filling games on graphs
• The complexity of free-flood-it on \(2\times n\) boards
• The consensus string problem for a metric is NP-complete

Cited in

(3)

• scientific article; zbMATH DE number 6399334 (Why is no real title available?)
• A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
• Biased random-key genetic algorithms for the weighted minimum broadcast time problem

Describes a project that uses

Uses Software

• GRASP
• irace
• GOAL
• CSparse

This page was built for publication: Efficient approaches for the flooding problem on graphs

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