A binary fruit fly optimization algorithm to solve the set covering problem

Conference Paper

Fecha

2015

Registro en:

9158, , 411-420

03029743

https://hdl.handle.net/20.500.12728/4248

https://repositorioslatinoamericanos.uchile.cl/handle/2250/5143080

Autor

Crawford B.

Soto R.

Torres-Rojas C.

Peña C.

Riquelme-Leiva M.

Misra S.

Johnson F.

Paredes F.

Institución

Universidad Autónoma de Chile

Materias

Combinatorial optimization problem

Fruit Fly Optimization Algorithm

Set Covering Problem

Combinatorial optimization

Computational complexity

Problem solving

Combinatorial optimization problems

Meta heuristics

Set covering problem

Mostrar el registro completo del ítem