Alternatives and similar repositories for simple_tsp

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

• D3M-Research-Group / odtlearn
  A package for tree-based statistical estimation and inference using optimal decision trees.
  ☆41Updated last year
• vidalt / OCEAN
  OCEAN: Optimal Counterfactual Explanations in Tree Ensembles (ICML 2021)
  ☆33Updated 2 weeks ago
• jvkersch / pyconcorde
  Python wrapper around the Concorde TSP solver
  ☆387Updated 6 months ago
• JHL-HUST / VSR-LKH-V2
  Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problem and its Variants
  ☆28Updated last year
• unit8co / medium-tsp
  Appendix repository for Medium article "Routing Traveling Salesmen on Random Graphs using Reinforcement Learning, in PyTorch"
  ☆58Updated 5 years ago
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆23Updated 2 years ago
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆29Updated 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.
  ☆72Updated last week
• bwilder0 / aaai_melding_code
  Code the AAAI 2019 paper "Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization"
  ☆34Updated 4 years ago
• dcaffo98 / transpormer
  TranSPormer: a transformer for the Travelling Salesman Problem
  ☆25Updated last year
• coin-or / GrUMPy
  A Python library for visualizing algorithms for solving mathematical optimization problems.
  ☆66Updated 4 years ago
• pigna90 / PCTSPTW
  Prize-Collecting Traveling Salesman Problem with Time Windows
  ☆14Updated 4 years ago
• awslabs / or-rl-benchmarks
  The source code for the paper: 'ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems'
  ☆85Updated 4 years ago
• kikocastroneto / lk_heuristic
  The Lin-Kernighan Heuristic implemented in python
  ☆39Updated last year
• alexforel / Explainable-CSO
  Code for "Explainable Data-Driven Optimization" (ICML 2023)
  ☆14Updated 2 years ago
• MIT-CAVE / rc-cli
  ☆51Updated 2 years ago
• rkimura47 / cmu-comp-or
  A series of tutorials for conducting computational experiments with optimization solvers
  ☆89Updated last year
• aws-samples / amazon-sagemaker-amazon-routing-challenge-sol
  AWS Last Mile Route Sequence Optimization
  ☆69Updated last year
• joaopedroso / scipbook
  ☆67Updated 6 years ago
• chaitjo / learning-tsp
  Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)
  ☆237Updated 4 years ago
• ds4dm / ml4co-competition
  Machine Learning for Combinatorial Optimization - NeurIPS'21 competition
  ☆137Updated 3 years ago
• vidalt / BA-Trees
  Born-Again Tree Ensembles: Transforms a random forest into a single, minimal-size, tree with exactly the same prediction function in the …
  ☆66Updated 2 years ago
• cerebis / LKH3
  Github mirror of Keld Helsgaun's wonderful LKH3 project.
  ☆29Updated 5 years ago
• dRehfeldt / SCIPJack-Steiner-tree-solver
  Very fast, exact Steiner tree solver
  ☆17Updated 3 years ago
• torressa / cspy
  A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
  ☆90Updated last year
• bstellato / mlopt
  The Machine Learning Optimizer
  ☆105Updated 2 years ago
• dietmarwo / fast-cma-es
  A Python 3 gradient-free optimization library
  ☆147Updated 2 months ago
• yorak / VeRyPy
  A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.
  ☆284Updated last year
• senshineL / GA-EAX-restart
  A state-of-the-art inexact solver for the Traveling Salesman problem (TSP).
  ☆28Updated 4 years ago
• coin-or / Dip
  DIP is a decomposition-based solver framework for mixed integer linear programs.
  ☆20Updated 3 months ago