Repositorio de Universidad Autónoma de Chile.
metadata only
Recent metaheuristics for the Weighted Set Covering problem
The Weighted Set Covering problem is a formal model for many industrial optimization problems. In the Weighted Set Covering Problem the goal is to choose a subset of columns of minimal cost in order to cover every row. Here, we present its resolution with two novel metaheuristics: Firefly Algorithm
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 Firefly algorithm for the set covering problem [Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos]#948660
- Binary bat algorithms for the set covering problem [Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos]#948525
- Adaptive Symbiotic Organisms Search Technique for Cost Optimization of Shell and Tube Heat Exchanger#940439
- A migrating birds optimization algorithm for machine-part cell formation problems#947774
- Opposition-based learning memetic algorithm for the maximum intersection of k-subsets problem#231625
Record · ID 947620
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