☆19May 8, 2026Updated 2 months ago
Alternatives and similar repositories for CODD
Users that are interested in CODD are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A Neural Separation Algorithm for the Rounded Capacity Inequalities (IJOC, 2024)☆16Feb 20, 2024Updated 2 years ago
- DDO a generic and efficient framework for MDD-based optimization.☆70May 23, 2025Updated last year
- ☆10Sep 16, 2020Updated 5 years ago
- Julia implementation of a revised simplex method for cpu and gpu☆18Oct 8, 2020Updated 5 years ago
- MaxiCP☆39Updated this week
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- ☆25Jun 12, 2024Updated 2 years ago
- Header-only C++23 template library for the bucket graph labeling algorithm for the Shortest Path Problem with Resource Constraints (SPPRC…☆26Jul 5, 2026Updated 2 weeks ago
- a collection of benchmarks (in DIMACS format) for various NP-Complete problems☆16May 21, 2025Updated last year
- RouteOpt☆94Apr 17, 2026Updated 3 months ago
- ☆17Dec 19, 2019Updated 6 years ago
- code with the RA-L'23 paper - "Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Heuristics"☆37Dec 11, 2025Updated 7 months ago
- The collection of my research papers' illustrations.☆22Oct 15, 2023Updated 2 years ago
- Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem☆25Mar 30, 2023Updated 3 years ago
- Discorde TSP is an easy-to-use API for Concorde TSP solver in C and C++ programming languages☆20Oct 8, 2018Updated 7 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- ☆17Jan 31, 2023Updated 3 years ago
- Benders Decomposition for SAHLP☆11Aug 17, 2023Updated 2 years ago
- Fork of the Concorde TSP solver with an easier build procedure☆15Mar 17, 2024Updated 2 years ago
- log parser for MIP and LP solvers☆21Aug 12, 2025Updated 11 months ago
- Codes and datasets for the paper Neural Embedded Mixed-Integer Optimization for Location-Routing Problems☆21Feb 25, 2026Updated 4 months ago
- Specification and description of the MathOptFormat file format☆19Sep 28, 2023Updated 2 years ago
- ☆11Jun 1, 2026Updated last month
- C++ implementation of an incremental primal-dual assignment problem solver.☆12Dec 13, 2024Updated last year
- A repository for long-term benchmarking of JuMP performance☆21Updated this week
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- STRIPS benchmarks for classical planning☆16Mar 29, 2022Updated 4 years ago
- Generators for linear programming instances with controllable difficulty and solution properties.☆14Apr 26, 2021Updated 5 years ago
- Code for solving LP on GPU using first-order methods☆238Jun 7, 2025Updated last year
- Collection of open source hypervolume codes that have been standardized to work with the MOEA Framework.☆13Apr 6, 2024Updated 2 years ago
- Julia package for polynomial optimization using semidefinite optimization.☆16Aug 11, 2020Updated 5 years ago
- Domain-Independent Dynamic Programming (DIDP) framework implemented in Rust.☆57Apr 10, 2026Updated 3 months ago
- Content Addressable Memory using dimensionality reduction☆13Apr 22, 2017Updated 9 years ago
- A solver for the fixed route vehicle charging problem☆24Jun 2, 2021Updated 5 years ago
- ☆32Nov 16, 2025Updated 8 months ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- An archive repository containing the MiniZinc instances used for the MiniZinc Challenge☆16Jul 9, 2026Updated 2 weeks ago
- Tools to analyze models for numerical issues and check solutions for feasibility☆30Jul 15, 2026Updated last week
- Rapidly formulate huge optimization models☆24Jul 6, 2026Updated 2 weeks ago
- ☆14Jan 25, 2026Updated 5 months ago
- Learning Domain-Independent Planning Heuristics over Hypergraphs (ICAPS'20)☆15Mar 21, 2025Updated last year
- ☆16Mar 15, 2024Updated 2 years ago
- ☆16Mar 3, 2026Updated 4 months ago