Repositorio de Universidad Autónoma de Chile.
metadata only
Cultural algorithms for the set covering problem
This paper addresses the solution of weighted set covering problems using cultural algorithms. The weighted set covering problem is a reasonably well known NP-complete optimization problem with many real world applications. We use a cultural evolutionary architecture to maintain knowledge of diversi
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
- Introducing CCOA (Clothing Context-Aware Optimization Algorithm): A Novel Metaheuristic Approach for Context-Aware Multi-Objective Optimization#687527
- The complexity of computing the covering radius of a Euclidean lattice#1129631
- Combinatorial Optimization#66996
- Emergency Vertex Cover#1033840
- Near-optimal edge partitioning via intersecting families#1141416
Record · ID 948550
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