A fast and fearless Collision Detection Engine for 2D nesting problems
Domain-Independent Dynamic Programming (DIDP) framework implemented in Rust.
a payment application intended for deployment by the united states treasury that replaces banking with accounting
Constraint Satisfaction Problem (CSP) Solver
Unofficial Rust wrappers to the C++ library Google OR-Tools, open source software for combinatorial optimization
Rust Progmmable Interface for Domain-Independent Dynamic Programming (RPID)
A Rust library for finding the optimal leaf node in a tree structure.
Generates optimal single-cog gag combinations given user constraints (back-end)
Combinatorial Optimisation Solving Travelling Salesperson Problem (TSP) Using a Simulated Annealing Algorithm
Rust terminal application for solving the weighted set cover problem using greedy and exact algorithms.
Generic Rust metaheuristic framework providing GA, BRKGA, Simulated Annealing, ALNS, Constraint Programming, and dispatching rules with trait-based domain separation.
Add a description, image, and links to the combinatorial-optimization topic page so that developers can more easily learn about it.
To associate your repository with the combinatorial-optimization topic, visit your repo's landing page and select "manage topics."