ed-lam / nutmeg
Nutmeg – a MIP and CP branch-and-check solver
☆23Updated last year
Alternatives and similar repositories for nutmeg:
Users that are interested in nutmeg are comparing it to the libraries listed below
- A C++ Framework for Optimization☆32Updated last week
- Branch-Cut-Price Framework☆28Updated 4 years ago
- A standalone local search solver for general mixed integer programming☆19Updated 2 months ago
- A solver for mixed integer bilevel programs☆50Updated 3 weeks ago
- A standalone local search solver for general integer linear programming☆16Updated 7 months ago
- Parallel Presolve for Integer and Linear Optimization☆40Updated 3 years ago
- ☆11Updated 5 years ago
- Parallel Presolve for Integer and Linear Optimization☆70Updated this week
- The MIP Workshop 2023 Computational Competition☆41Updated last year
- Feasibility Jump☆25Updated last year
- MIP 2024 Computational Competition☆18Updated last year
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆46Updated last year
- Interactive Performance Evaluation Tools for Optimization Software☆26Updated last year
- Fork of the Concorde TSP solver with an easier build procedure☆12Updated 10 months ago
- A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems☆16Updated 2 years ago
- Branch-and-Price-and-Cut in Julia☆196Updated last month
- Code for "Explainable Data-Driven Optimization" (ICML 2023)☆15Updated last year
- ☆64Updated 2 months ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆25Updated 2 years ago
- Combinatorial Optimization in Gurobi☆42Updated last year
- A solver based on column generation☆26Updated last month
- ☆30Updated last year
- Material for the ISCO 2018 spring school: “Advanced Mixed Integer Programming Formulation Techniques”☆15Updated 6 years ago
- Branch-and-Price Algorithm for the Bin Packing Problem (using CPLEX as pricer and LP solver). It implements a Ryan-Foster branching schem…☆15Updated 5 years ago
- Benders decomposition to solve mixed integer linear programming, especially stochastic programming in seconds!☆25Updated 5 years ago
- Presentation: Custom MIP Heuristics☆33Updated 3 years ago
- Visual representation of the branch-and-cut tree of SCIP using spatial dissimilarities of LP solutions☆28Updated 2 years ago
- DIP is a decomposition-based solver framework for mixed integer linear programs.☆19Updated 4 years ago
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆130Updated last month