A Binary Firefly Algorithm for the Set Covering Problem

This publication has 24 references indexed in Scilit:

• On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the Set Covering Problem
  Computers & Industrial Engineering, 2006
• A Heuristic Method for the Set Covering Problem
  Operations Research, 1999
• A Lagrangian-based heuristic for large-scale set covering problems
  Mathematical Programming, 1998
• Automatic Optimization of Subproblems in Scheduling Airline Crews
  Interfaces, 1997
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
  Operations Research, 1996
• A genetic algorithm for the set covering problem
  European Journal of Operational Research, 1996
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
  Management Science, 1990
• Optimal Selection of Ingot Sizes Via Set Covering
  Operations Research, 1987
• Using a facility location algorithm to solve large set covering problems
  Operations Research Letters, 1984
• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979