Efficient approaches for the flooding problem on graphs

DOI10.1007/S10479-018-2796-0zbMATH Open1442.90160OpenAlexW2792497325MaRDI QIDQ2178332FDOQ2178332

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

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

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

zbMATH Keywords

metaheuristicsevolutionary algorithmsiterated local searchGRASPmixed integer problemflooding problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm
• Title not available (Why is that?)

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)