Application of negative learning ant colony optimization to the far from most string problem

DOI10.1007/978-3-031-30035-6_6OpenAlexW4361858638MaRDI QIDQ6149093

Pedro Pinacho Davidson, Christian Blum

Publication date: 12 January 2024

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30035-6_6

zbMATH Keywords

combinatorial optimizationant colony optimizationfar from most String problemnegative learning

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Exact algorithm and heuristic for the closest string problem
• Distinguishing string selection problems.
• Efficient solutions for the far from most string problem
• On some optimization problems in molecular biology
• Hybridizations of GRASP with path relinking for the far from most string problem

This page was built for publication: Application of negative learning ant colony optimization to the far from most string problem