Repositorio de Universidad Autónoma de Chile.
metadata only
Binarization methods for shuffled frog leaping algorithms that solve set covering problems
This work proposes Shuffled Frog Leaping Algorithms (SFLAs) to solve Set Covering Problems (SCPs). The proposed algorithms include eight transfer function and five discretization methods in order to solve the binary representation of SCP. Different instances of the SetCovering Problem are solved to
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
- Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm#824270
- Improved Algorithms for the Remote Point Problem#1061397
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1156455
- Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming#785147
- Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming#783557
Record · ID 936017
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