Solving the set covering problem with a binary black hole inspired algorithm

Conference Paper

Fecha

2016

Registro en:

9786, , 207-219

03029743

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

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

Autor

Rubio Á.G.

Crawford B.

Soto R.

Olguín E.

Misra S.

Jaramillo A.

Villablanca S.M.

Salas J.

Institución

Universidad Autónoma de Chile

Materias

Binary black hole

Combinatorial optimization problem

Meta heuristics

Set Covering Problem

Combinatorial optimization

Cost engineering

Combinatorial optimization problems

Meta heuristics

Set covering problem

Mostrar el registro completo del ítem