Efficient approaches for the flooding problem on graphs
DOI10.1007/s10479-018-2796-0zbMath1442.90160OpenAlexW2792497325MaRDI QIDQ2178332
Luiz Satoru Ochi, André Renato Villela da Silva, Bruno José da Silva Barros, Rian Gabriel 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
metaheuristicsGRASPevolutionary algorithmsiterated local searchmixed integer problemflooding problem
Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GOAL solver: a hybrid local search based solver for high school timetabling
- The complexity of free-flood-it on \(2\times n\) boards
- The complexity of flood-filling games on graphs
- On the minimization of traffic congestion in road networks with tolls
- The complexity of flood filling games
- The consensus string problem for a metric is NP-complete
- Fun with algorithms. 5th international conference, FUN 2010, Ischia, Italy, June 2--4, 2010. Proceedings
- Exact and heuristic approaches for the cycle hub location problem
- Greedy randomized adaptive search procedures
- Probability distribution of solution time in GRASP: an experimental investigation
- Flooding games on graphs
- A biased random-key genetic algorithm for the minimization of open stacks problem
- Métodos tipo dual simplex para problemas de otimização linear canalizados e esparsos
- Parameterized Complexity of Flood-Filling Games on Trees
- A survey of direct methods for sparse linear systems
This page was built for publication: Efficient approaches for the flooding problem on graphs
