Results for knapsack_solver

abstractions for filtering which OutputGroups we may use in coin selection -- an OutputGroup is a group of UTXOs paid to the same output script

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.

Rust bindings for Google OR-Tools SCIP mixed-integer programming solver

Fast binned greedy repair heuristics for 0/1 knapsack, with an XDP comparison solver.

DDO a generic and efficient framework for MDD-based optimization.

Experimental 0/1 knapsack implementations in Rust focused on optimized XDP approximations and heuristics.

Gurobi backend for oximo

A mixed integer linear programming modeling language to solve linear optimization models. Extensible, works in WASM and easy to use.

Model I/O (MPS writer, LP writer) for oximo

Optimization module for SciRS2 (scirs2-optimize)

The first compiled Unix shell — bytecode VM, worker pool, AOP intercept, Rkyv caching

A constraint programming solver.

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.