Extended Cross-Population (ExP) Heatmap
-
Updated
Oct 1, 2026 - Python
Extended Cross-Population (ExP) Heatmap
This project contains a solution to the Travelling Salesman Person Problem and the 0/1 Knapsack Problem using a Genetic Algorithm with different customizations and setups.
Candidate selection using an iterative soft-thresholding algorithm
Fundamental using Algorithm in python
🍀 Own proposal of Selection Algorithm: Logarithmic Weighted Random Selector; choose a random element of a list; but the closer the element is to the start is more probability to appear, based on logarithmic scale.
Inspired by Google's Foobar challenge. It automates secretive candidate selection based on online activity, provides timed coding challenges, and allows hiring managers to evaluate submissions
Selection algorithm with O(n log n) worst-case runtime
A mass simulation environment for route finding selection algorithms with a minimal UI.
Synastry-optimized crew selection model for Mars missions — 14.8% projected conflict reduction
To associate your repository with the selection-algorithms topic, visit your repo's landing page and select "manage topics."