Alternatives and similar repositories for simple_tsp

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

• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆22Updated 2 years ago
• torressa / cspy
  A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
  ☆85Updated 11 months ago
• JHL-HUST / VSR-LKH-V2
  Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problem and its Variants
  ☆26Updated last year
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆26Updated last year
• chkwon / PyHygese
  A Python wrapper for the Hybrid Genetic Search algorithm for Capacitated Vehicle Routing Problems (HGS-CVRP)
  ☆91Updated 2 months ago
• D3M-Research-Group / odtlearn
  A package for tree-based statistical estimation and inference using optimal decision trees.
  ☆40Updated 10 months ago
• PyVRP / VRPLIB
  Python package to read and write vehicle routing problem instances.
  ☆110Updated 3 weeks ago
• coin-or / Bcp
  Branch-Cut-Price Framework
  ☆30Updated 4 years ago
• inria-UFF / VRPSolverEasy
  A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems
  ☆143Updated 5 months ago
• ahottung / NLNS
  Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem
  ☆91Updated 4 years ago
• kikocastroneto / lk_heuristic
  The Lin-Kernighan Heuristic implemented in python
  ☆34Updated last year
• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated 10 months ago
• Spider-scnu / Monte-Carlo-tree-search-for-TSP
  This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).
  ☆33Updated 5 years ago
• yhnju / tspFormer
  This is the implementation of my paper "Memory-Efficient Transformer-based Network Model for Traveling Salesman Problem"
  ☆26Updated 3 years ago
• mit-wu-lab / learning-to-delegate
  [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing
  ☆83Updated 3 years ago
• google-research / tf-opt
  ☆39Updated 2 months ago
• alberto-santini / cvrp-decomposition
  Decomposition Strategies for Vehicle Routing Heuristics
  ☆29Updated last year
• 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
• domain-independent-dp / didp-rs
  Domain-Independent Dynamic Programming (DIDP) framework implemented in Rust.
  ☆44Updated last month
• ntnu-arl / LKH_TSP
  A set of tools to solve TSP problems using the LKH solver
  ☆97Updated 9 years ago
• tumBAIS / euro-meets-neurips-2022
  ☆47Updated last year
• MIT-CAVE / rc-cli
  ☆50Updated 2 years ago
• bstellato / mlopt
  The Machine Learning Optimizer
  ☆104Updated 2 years ago
• shaowei-cai-group / Local-MIP
  A standalone local search solver for general mixed integer programming
  ☆22Updated 3 months ago
• jvkersch / pyconcorde
  Python wrapper around the Concorde TSP solver
  ☆372Updated 2 months ago
• alexforel / Explainable-CSO
  Code for "Explainable Data-Driven Optimization" (ICML 2023)
  ☆14Updated last year
• cerebis / LKH3
  Github mirror of Keld Helsgaun's wonderful LKH3 project.
  ☆27Updated 4 years ago
• Kuifje02 / vrpy
  A python framework for solving the VRP and its variants with column generation.
  ☆196Updated 2 years ago
• lyeskhalil / mipGNN
  ☆26Updated 4 years ago
• chaitjo / learning-tsp
  Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)
  ☆231Updated 3 years ago