Repositorio de Universidad Autónoma de Chile.
metadata only
Binary Firefly algorithm for the set covering problem [Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos]
The set cover problem, belongs to the branch of combinatorial optimization problems, whose complexity is exponential theoretically established as NP-complex problems. Consists in finding a subset of columns in a matrix of zeros and ones such that cover all rows of the matrix at a minimal cost. In th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Binary bat algorithms for the set covering problem [Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos]#948525
- Recent metaheuristics for the Weighted Set Covering problem#947620
- Fireworks explosion can solve the set covering problem#948585
- On the Complexity of Forcing and Anti-Forcing Minimum Cuts#1118004
- Solving set covering problem with fireworks explosion#948004
Record · ID 948660
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive