There are 13 repositories under mixed-integer-programming topic.
Modeling language for Mathematical Optimization (linear, mixed-integer, conic, semidefinite, nonlinear)
Mathematical Optimization in Julia. Local, global, gradient-based and derivative-free. Linear, Quadratic, Convex, Mixed-Integer, and Nonlinear Optimization in one simple, fast, and differentiable interface.
NVIDIA cuOpt examples for decision optimization
Represent trained machine learning models as Pyomo optimization formulations
Efficient modeling interface for mathematical optimization in Python
General optimization (LP, MIP, QP, continuous and discrete optimization etc.) using Python
A JuMP-based Nonlinear Integer Program Solver
Derivative-Free Global Optimization Algorithm (C++, Python binding) - Continuous, Discrete, TSP, NLS, MINLP
A solver for mixed-integer convex optimization
Certifiable Outlier-Robust Geometric Perception
Hands-on course about linear programming and mathematical optimization.
Humble 3D knapsack / bin packing solver
Solving the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) using Mixed Integer Linear Programming (MILP) in Python with the Gurobi API.
An open-source parallel optimization solver for structured mixed-integer programming
Model Predictive Control of a Flappy Bird Clone using Mixed Integer Programming
Exact solutions for two-dimensional bin packing problems by branch-and-cut
Python implementation to solve Vehicle Routing problem & Master Production Scheduling in Supply Chain Analytics & Design.
Multiobjective black-box optimization using gradient-boosted trees
A Julia/JuMP Package for Optimal Quantum Circuit Design
A predictive model to help Uber drivers make more money
Repository contains implementation of Bender Decomposition for classical facility/warehause location problem using Python and Gurobi solver.
Repository contains implementation of Branch and Prive for classical General Assignment Problem problem using Python and Gurobi solver.
Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm