Alternatives and similar repositories for Branch-and-Bound-Algorithms:

Users that are interested in Branch-and-Bound-Algorithms are comparing it to the libraries listed below

• RafaelGoncalves8 / branch-and-bound
  Branch and Bound algorithm implemented as project for optimization course EA044.
  ☆11Updated 7 years ago
• alberto-santini / cplex-example
  Solving a TSP with the CPLEX C++ API.
  ☆51Updated 4 years ago
• PyJobShop / PyJobShop
  Solving scheduling problems with constraint programming in Python.
  ☆27Updated last week
• AustinLBuchanan / Combinatorial-Optimization-in-Gurobi
  Combinatorial Optimization in Gurobi
  ☆42Updated last year
• jiedxu / BendersOptim
  Benders decomposition to solve mixed integer linear programming, especially stochastic programming in seconds!
  ☆25Updated 5 years ago
• coin-or / Bcp
  Branch-Cut-Price Framework
  ☆28Updated 4 years ago
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆23Updated last year
• coin-or / Cgl
  Cut Generator Library
  ☆25Updated last month
• alberto-santini / maritime-vrp
  Branch-and-price solver for the Feeder Network Design Problem
  ☆34Updated last year
• khalil-research / Neur2RO
  ☆25Updated last month
• RahmanKhorramfar91 / Integer-Benders-for-Stochastic-Programming
  Implementation of Integer bender's cut for SP proposed by Laporte et al.
  ☆10Updated 5 years ago
• borelian / AdaptiveBenders
  Code and computational experiments of the paper "Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs" by Cristian Ramírez-Pico…
  ☆14Updated last year
• coin-or / MibS
  A solver for mixed integer bilevel programs
  ☆50Updated this week
• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated 6 months ago
• UmbertoJr / ML-Constructive
  ML-Constructive is a deep learning based constructive heuristic for the Traveling Salesman Problem.
  ☆11Updated 11 months ago
• Gurobi / pres-mipheur
  Presentation: Custom MIP Heuristics
  ☆33Updated 3 years ago
• lbliek / MVRSM
  MVRSM algorithm for optimising mixed-variable expensive cost functions.
  ☆12Updated 5 months ago
• tkralphs / CuPPy
  A naive implementation of the Gomory cutting plane algorithm
  ☆14Updated 4 years ago
• Lyxn / linprog
  Linear Programming in Short
  ☆18Updated 3 years ago
• coin-or / Dip
  DIP is a decomposition-based solver framework for mixed integer linear programs.
  ☆19Updated 4 years ago
• hlefebvr / idol
  A C++ Framework for Optimization
  ☆30Updated last month
• spkelle2 / vehicle_routing_column_generation
  A demo on how use column generation in a primal heuristic for the Vehicle Routing Problem with Time Windows (VRPTW)
  ☆16Updated last year
• boldm1 / robust-mrcpsp
  Python code to solve robust multi-mode resource constrained project scheduling problem using Benders' decomposition approach vs compact m…
  ☆10Updated 2 years ago
• shaowei-cai-group / Local-MIP
  A standalone local search solver for general mixed integer programming
  ☆18Updated last month
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆25Updated 2 years ago
• wujianjack / optimizationmodels
  Optimization models using various solvers
  ☆91Updated 7 years ago
• vidalt / Split-Library
  Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …
  ☆16Updated 6 years ago
• or-fusion / pao
  A Python Package for Adversarial Optimization
  ☆18Updated last year
• fontanf / columngenerationsolver
  A solver based on column generation
  ☆26Updated this week
• coin-or / COIN-OR-OptimizationSuite
  A harness for building the bundled suite of interoperable optimization tools available in the COIN-OR repository.
  ☆123Updated 3 years ago