google-research / tf-optLinks
☆41Updated this week
Alternatives and similar repositories for tf-opt
Users that are interested in tf-opt are comparing it to the libraries listed below
Sorting:
- The source code for the paper: 'ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems'☆85Updated 4 years ago
- [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing☆85Updated 3 years ago
- Machine Learning for Combinatorial Optimization - NeurIPS'21 competition☆135Updated 2 years ago
- Population-Based Reinforcement Learning for Combinatorial Optimization☆77Updated last year
- Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization☆195Updated 4 years ago
- Efficient Active Search☆52Updated 3 years ago
- ☆35Updated 5 years ago
- Reinforcement learning for operation research problems with OpenAI Gym and CleanRL☆111Updated 2 years ago
- Hybrid Models for Learning to Branch (NeurIPS 2020)☆50Updated 4 years ago
- This is the official repository of the AI for TSP competition at IJCAI 2021☆24Updated 2 years ago
- Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem☆95Updated 4 years ago
- ☆32Updated 2 years ago
- ☆48Updated 3 years ago
- DPDP☆101Updated 2 years ago
- Hierarchical deep reinforcement learning for combinatorial optimization problem☆35Updated 5 years ago
- ☆18Updated 9 months ago
- This repo implements our paper, "Efficient Neural Neighborhood Search for Pickup and Delivery Problems", which has been accepted as short…☆60Updated 2 years ago
- ☆56Updated 2 years ago
- Algorithms for the Orienteering Problem☆40Updated 2 months ago
- This repo implements our paper, "Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer", which has be…☆113Updated last year
- Deep Reinforced Multi-Pointer Transformer forthe Traveling Salesman Problem☆39Updated 3 years ago
- ☆40Updated last year
- [ICML'24 FM-Wild Oral] RouteFinder: Towards Foundation Models for Vehicle Routing Problems☆71Updated 2 months ago
- ☆21Updated 3 years ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆33Updated 5 years ago
- Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)☆68Updated 3 years ago
- Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning☆53Updated 4 years ago
- Uber's Multi-Agent Routing Value Iteration Network☆65Updated 4 years ago
- Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)☆231Updated 3 years ago
- Code for the paper 'On Learning Paradigms for the Travelling Salesman Problem' (NeurIPS 2019 Graph Representation Learning Workshop)☆33Updated 4 years ago