Experimental 0/1 knapsack implementations in Rust focused on optimized XDP approximations and heuristics.
Knapsack problem resolution using oxigen.
DDO a generic and efficient framework for MDD-based optimization.
A binary serialization libary
Fast binned greedy repair heuristics for 0/1 knapsack, with an XDP comparison solver.
Core scheduling algorithms for HPC job schedulers: multi-dimensional knapsack solver, composite cost function, topology-aware placement, reservation-based backfill, conformance grouping, preemption, and walltime enforcement.
procedural macro that implements memoization for dynamic programming
A Rust procedural macro library for memoization with MauQueue optimization
abstractions for filtering which OutputGroups we may use in coin selection -- an OutputGroup is a group of UTXOs paid to the same output script
Solve the knapsack problem and its variants
Heuristics for the Knapsack Problem
Solving multi-objective optimization problems using genetic algorithms.
Knapsacker is a Knapsack (combinatorial opimization) problem solver with Branch and bound algorithm.
Parallel tests across CI server nodes based on each test file's time execution. It generates a test time execution report and uses it for future test runs.
Haversack is an enumberable abstraction of a Knapsack
Knapsack Pro wraps your current test runner(s) and works with your existing CI infrastructure to parallelize tests optimally. It dynamically splits your tests based on up-to-date test execution data. It's designed from the ground up for CI and supports all of them.
This gem contains command-line utility for solving 0/1 knapsack problem using branch-and-bound method, dynamic programming, simple heuristic (weight/price) and fully polynomial time approximation scheme. It can measure CPU and wall-clock time spent by solving a problem, compute relative error of the result and generate graphs from those values.