Alternatives and similar repositories for SCOT

Users that are interested in SCOT are comparing it to the libraries listed below

• Alirezalm / SCOTpy
  SCOT Python API and tools
  ☆10Updated 2 years ago
• dchetelat / subadditive
  ☆19Updated 2 years ago
• GioniMexi / FeasPumpCollection
  Feasibility Pump Collection
  ☆16Updated 2 years ago
• hlefebvr / idol
  A C++ Framework for Optimization
  ☆36Updated this week
• INFORMSJoC / 2023.0106
  ☆13Updated last year
• lseman / baldes
  Bucket Graph Labeling Algorithm for Vehicle Routing
  ☆20Updated 11 months ago
• SINTEF / feasibilityjump
  Feasibility Jump
  ☆29Updated 2 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 2 years ago
• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated last year
• dparo / master-thesis
  A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
  ☆16Updated 2 years ago
• pathwyse / pathwyse
  PathWyse: a flexible, open-source library for the resource constrained shortest path problem
  ☆28Updated 7 months ago
• vidalt / PDTSP
  Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…
  ☆19Updated 3 years ago
• Pigzaum / cg_cvrp
  A column generation algorithm (CG) for the capacitated vehicle routing problem (CVRP)
  ☆17Updated 3 years ago
• fontanf / columngenerationsolver
  A solver based on column generation
  ☆39Updated last month
• pedroszattoni / InvOpt
  An open-source Python package to solve Inverse Optimization problems.
  ☆18Updated last year
• inria-UFF / BaPCodVRPSolver.jl
  A Julia interface for VRPSolver
  ☆17Updated 2 months ago
• psanse / CliSAT
  An exact algorithm for the maximum clique problem (MCP) which improves over state-of-the-art approaches in some cases by orders of magnit…
  ☆14Updated 2 months ago
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆24Updated 3 years ago
• cvneves / ILS-SP-CVRP
  A matheuristic approach for the Capacitated Vehicle Routing Problem
  ☆51Updated 3 years ago
• alberto-santini / concorde-easy-build
  Fork of the Concorde TSP solver with an easier build procedure
  ☆15Updated last year
• hyeonahkimm / neuralsep
  A Neural Separation Algorithm for the Rounded Capacity Inequalities (IJOC, 2024)
  ☆14Updated last year
• acco93 / cobra
  A set of reusable components for fast prototyping CVRP heuristic solution approaches.
  ☆19Updated 6 months ago
• d-krupke / cpsat-autotune
  WIP: Tune the hyperparameters of Google's OR-Tools' CP-SAT solver for specific models
  ☆22Updated 4 months ago
• jdumouchelle / IntegerLShaped
  A python implementation of the integer L-shaped method for solving two stage stochastic programs.
  ☆26Updated last year
• ambros-gleixner / MIPcc23
  The MIP Workshop 2023 Computational Competition
  ☆40Updated 2 years ago
• N-Wouda / Euro-NeurIPS-2022
  OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.
  ☆17Updated 3 years ago
• acco93 / filo2
  A more scalable version of FILO.
  ☆31Updated 3 weeks ago
• avrech / learning2cut
  Reinforcement Learning for Cut Selection
  ☆12Updated 3 years ago
• alberto-santini / cvrp-decomposition
  Decomposition Strategies for Vehicle Routing Heuristics
  ☆32Updated 2 years ago
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆35Updated 9 months ago