A Java Stochastic Dynamic Programming Library
Implementation of the 0-1 Knapsack Problem
Sequence Alignment (Needleman–Wunsch Algorithm using Dynamic Programming) for aligning sequences (words, sentences, DNA etc.)
Greedy Algorithm to find the maximum number of mutually compatible jobs
Weighted Interval Scheduling, the classic Dynamic Programming problem implemented in Java
Exact solver for the Traveling Umpire Problem that uses a branch-and-bound algorithm with decomposition-based lower bounds, implementing the approach developed by T. Â. M. Toffolo (2017).
This repository is intended to work as an archive to collect the best (i.e. most efficient) solutions to leetcode problems, both in space and time.
This repository is intended to work as an archive to collect the best (i.e. most efficient) solutions to hackerrank problems, both in space and time.
Trabalho de SO sobre algoritmos de Substituição de página
Java graph traversal and path finding algorithms library. Implements Iterative deepening A* (IDA*)
Add a description, image, and links to the optimal topic page so that developers can more easily learn about it.
To associate your repository with the optimal topic, visit your repo's landing page and select "manage topics."