A solver for the generalized assignment problem
☆23Apr 17, 2026Updated 2 weeks ago
Alternatives and similar repositories for generalizedassignmentsolver
Users that are interested in generalizedassignmentsolver are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Set Partitioning Heuristic (SPH) based on CPLEX MILP solver and created starting from the CFT Heuristic implemented by Accorsi Luca and C…☆14Dec 1, 2023Updated 2 years ago
- A solver based on column generation☆42Dec 27, 2025Updated 4 months ago
- Feasibility Pump Collection☆16Jul 6, 2023Updated 2 years ago
- A standalone local search solver for general integer linear programming☆16Jul 8, 2024Updated last year
- RouteOpt☆83Apr 17, 2026Updated 2 weeks 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.
- Solve optimization problems and build custom algorithms☆38Apr 24, 2026Updated last week
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆12Jan 31, 2022Updated 4 years ago
- Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …☆21Oct 19, 2018Updated 7 years ago
- A Julia interface for VRPSolver☆18Nov 17, 2025Updated 5 months ago
- Branch-and-Price Algorithm for the Bin Packing Problem (using CPLEX as pricer and LP solver). It implements a Ryan-Foster branching schem…☆16Feb 24, 2019Updated 7 years ago
- ☆22Jun 12, 2024Updated last year
- Bucket Graph Labeling Algorithm for Vehicle Routing☆22Apr 22, 2026Updated last week
- C++ implementation of an incremental primal-dual assignment problem solver.☆12Dec 13, 2024Updated last year
- A demo on how use column generation in a primal heuristic for the Vehicle Routing Problem with Time Windows (VRPTW)☆18Jan 24, 2023Updated 3 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Implementation of Integer bender's cut for SP proposed by Laporte et al.☆11Nov 6, 2019Updated 6 years ago
- Download and read data from CVRPLIB: http://vrp.atd-lab.inf.puc-rio.br/index.php/en/☆13Jan 23, 2026Updated 3 months ago
- This repository contains resources for Facility Location and Location Allocation. It is intended for research and educational use. Noth…☆20May 12, 2016Updated 9 years ago
- DDO a generic and efficient framework for MDD-based optimization.☆69May 23, 2025Updated 11 months ago
- It's the implementation for "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems"☆24May 20, 2024Updated last year
- Multi-platform, self-contained and object-oriented implementation of the Simplex Algorithm in C++☆14Mar 11, 2021Updated 5 years ago
- Modern implementation of the hybrid genetic search (HGS) algorithm specialized to the capacitated vehicle routing problem (CVRP). This co…☆427Mar 26, 2025Updated last year
- Julia interface to COIN-OR Optimization Services https://projects.coin-or.org/OS☆16Feb 8, 2020Updated 6 years ago
- Source for michaeldwan.com☆15Dec 19, 2015Updated 10 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- A Julia package to manage Constraint-Based Local Search (CBLS) solvers.☆29Feb 16, 2026Updated 2 months ago
- 2023年MathorCup数学建模比赛C题论文代码思路分享☆10Dec 30, 2023Updated 2 years ago
- Genetic Algorithm, Memetic Algorithms, GRASP, Simulated Annealing, Multi start search, Reiterated Local Search, Local Search, Greedy and…☆20Jun 1, 2018Updated 7 years ago
- Finds the concave hull around a set of points by leveraging the Delaunay triangulation☆37Sep 29, 2024Updated last year
- HybridCVRP: A Hybrid Metaheuristic Solver for the Capacitated Vehicle Routing Problem☆28Oct 15, 2022Updated 3 years ago
- Domain-Independent Dynamic Programming (DIDP) framework implemented in Rust.☆54Apr 10, 2026Updated 3 weeks ago
- DIP is a decomposition-based solver framework for mixed integer linear programs.☆20Jan 14, 2026Updated 3 months ago
- ScheduleOpt benchmarks☆23Updated this week
- ☆13Jun 19, 2025Updated 10 months ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Used branch and bound algorithms to solve NP Hard problems on a cluster of workstations.☆11Jul 18, 2014Updated 11 years ago
- An accelerated Bender's decomposition approach to solve a two-stage stochastic model of a formulate a capacitated facility location probl…☆13Aug 8, 2020Updated 5 years ago
- Branch-and-Price-and-Cut in Julia☆213Sep 8, 2025Updated 7 months ago
- ☆10Nov 15, 2023Updated 2 years ago
- Mathematical Modeling for Optimization and Machine Learning☆156Oct 2, 2025Updated 7 months ago
- Material for the ISCO 2018 spring school: “Advanced Mixed Integer Programming Formulation Techniques”☆16Apr 14, 2018Updated 8 years ago
- A C++ wrapper for SCIP☆31Dec 18, 2025Updated 4 months ago