A biased random-key genetic algorithm for the Steiner triple covering problem
From MaRDI portal
Publication:691474
DOI10.1007/s11590-011-0285-3zbMath1262.90151OpenAlexW2060604129MaRDI QIDQ691474
José Fernando Gonçalves, Mauricio G. C. Resende, Rodrigo F. Toso
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0285-3
metaheuristicsgenetic algorithmset coveringbiased random-key genetic algorithmrandom keysSteiner triple covering
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
An efficient local search heuristic with row weighting for the unicost set covering problem ⋮ A biased random-key genetic algorithm for the capacitated minimum spanning tree problem ⋮ A biased random key genetic algorithm for the field Technician scheduling problem ⋮ An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
Uses Software
Cites Work
- Improved solutions to the Steiner triple covering problem
- Russian doll search for the Steiner triple covering problem
- A probabilistic heuristic for a computationally difficult set covering problem
- An interior point algorithm to solve computationally difficult set covering problems
- Approximation algorithms for combinatorial problems
- Solving hard set covering problems
- Solving large Steiner Triple Covering Problems
- Global optimization by continuous grasp
- A note on some computationally difficult set covering problems
- Mersenne twister
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
