scientific article; zbMATH DE number 2079889

zbMATH Open1044.68757MaRDI QIDQ4472025FDOQ4472025

Authors: Markus Finger, Thomas Stützle, Helena R. Lourenço 

Publication date: 3 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2279/22790061.htm

Title of this publication is not available (Why is that?)

Recommendations

• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Genetic algorithms applied to computationally difficult set covering problems
• Algorithms for the set covering problem
• An empirical study of hybrid genetic algorithms for the set covering problem
• An improved genetic algorithm for the set covering problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cited In (3)

• Application of ant colony optimization metaheuristic on set covering problems
• Exploring further advantages in an alternative formulation for the set covering problem
• The set covering problem revisited: an empirical study of the value of dual information

This page was built for publication:

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