Alternatives and similar repositories for SCIPJack-Steiner-tree-solver

Users that are interested in SCIPJack-Steiner-tree-solver are comparing it to the libraries listed below

• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated 11 months ago
• alberto-santini / concorde-easy-build
  Fork of the Concorde TSP solver with an easier build procedure
  ☆14Updated last year
• fontanf / columngenerationsolver
  A solver based on column generation
  ☆30Updated last month
• tumBAIS / RoutingBlocks
  A modular Python package for the development of metaheuristic algorithms for Vehicle Routing Problems with Intermediate Stops
  ☆24Updated last year
• N-Wouda / Euro-NeurIPS-2022
  OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.
  ☆17Updated 2 years ago
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆29Updated last month
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆22Updated 2 years ago
• airbus / discrete-optimization
  Discrete Optimization is a python library to ease the definition and re-use of discrete optimization problems and solvers.
  ☆59Updated this week
• cerebis / LKH3
  Github mirror of Keld Helsgaun's wonderful LKH3 project.
  ☆27Updated 4 years ago
• CharJon / GeCO
  Generators for Combinatorial Optimization
  ☆18Updated 2 years ago
• ortec / euro-neurips-vrp-2022-quickstart
  Quickstart for EURO Meets NeurIPS 2022 Vehicle Routing Competition
  ☆96Updated 2 years ago
• fabiofurini / LocationCovering
  Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem
  ☆15Updated 2 years ago
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆26Updated last year
• ntnu-arl / LKH_TSP
  A set of tools to solve TSP problems using the LKH solver
  ☆97Updated 9 years ago
• Zhengzhong-You / RouteOpt
  RouteOpt
  ☆39Updated this week
• cfld / simple_tsp
  Python/Numba implemenation of of Lin-Kernighan-style TSP solver
  ☆19Updated 4 years ago
• inria-UFF / location-routing
  A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems
  ☆18Updated 2 years ago
• alberto-santini / cvrp-decomposition
  Decomposition Strategies for Vehicle Routing Heuristics
  ☆29Updated last year
• fontanf / roadef2018
  Team J28 submission for the ROADEF/EURO Challenge 2018
  ☆12Updated 5 years ago
• c4v4 / sph
  Set Partitioning Heuristic (SPH) based on CPLEX MILP solver and created starting from the CFT Heuristic implemented by Accorsi Luca and C…
  ☆14Updated last year
• heldstephan / jpt-amz
  ☆61Updated 9 months ago
• ed-lam / bcp-mapf
  BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
  ☆93Updated 2 months ago
• coin-or / Bcp
  Branch-Cut-Price Framework
  ☆30Updated 4 years ago
• chkwon / PyHygese
  A Python wrapper for the Hybrid Genetic Search algorithm for Capacitated Vehicle Routing Problems (HGS-CVRP)
  ☆91Updated 2 months ago
• hlefebvr / idol
  A C++ Framework for Optimization
  ☆34Updated 2 weeks ago
• nagata-yuichi / GA-EAX
  A genetic algorithm using Edge Assembly Crossover for the traveling salesman problem
  ☆32Updated 3 years ago
• wata-orz / steiner_tree
  Steiner tree solver
  ☆30Updated 7 years ago
• acco93 / filo2
  A more scalable version of FILO.
  ☆23Updated 4 months ago
• acco93 / filo
  A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.
  ☆48Updated last year
• tumBAIS / euro-meets-neurips-2022
  ☆47Updated last year