- Nizhniy Novgorod, Russian Federation
- http://famer.github.io
Popular repositories Loading
-
-
knapsack-and-max-sat
knapsack-and-max-sat PublicMIE-PAA problems and algorithms. Knapsack problem solutions: brute force, branch and bound, dynamic programming, FPTAS approximation algorithm, Simulated Annealing. MAX-SAT: Simulated Annealing
Python 3
-
-
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.