heldstephan / exactcolorsLinks
Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.
☆15Updated 6 months ago
Alternatives and similar repositories for exactcolors
Users that are interested in exactcolors are comparing it to the libraries listed below
Sorting:
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆51Updated 2 years ago
- ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.☆77Updated last year
- Modern implementation of the hybrid genetic search (HGS) algorithm specialized to the capacitated vehicle routing problem (CVRP). This co…☆413Updated 9 months ago
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆159Updated 2 months ago
- RouteOpt☆72Updated 3 weeks ago
- Elementary Shortest Path Problem with Resource Constraints☆33Updated last year
- A C++ Framework for Optimization☆36Updated 3 weeks ago
- Bucket Graph Labeling Algorithm for Vehicle Routing☆20Updated 10 months ago
- A matheuristic approach for the Capacitated Vehicle Routing Problem☆51Updated 3 years ago
- Machine-learning-based column selection☆40Updated 4 years ago
- Elementary shortest path problem with resource constraint☆28Updated last month
- A solver based on column generation☆38Updated 2 weeks ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆35Updated 8 months ago
- It's the implementation for "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems"☆23Updated last year
- Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…☆19Updated 2 years ago
- Elementary branch-price-and-cut algorithm for the vehicle routing problem with stochastic demands under optimal restocking☆17Updated 2 years ago
- This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with …☆56Updated last year
- 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
- ☆14Updated last year
- A genetic algorithm using Edge Assembly Crossover for the traveling salesman problem☆39Updated 4 years ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆13Updated 3 years ago
- A set of reusable components for fast prototyping CVRP heuristic solution approaches.☆19Updated 5 months ago
- A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem☆16Updated 2 years ago
- Branch-Cut-Price Framework☆31Updated 5 years ago
- column generation + ESPPRC + pulse algorithm☆30Updated 6 years ago
- OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.☆17Updated 3 years ago
- Branch-price-and-cut code for the VRPTW☆28Updated 2 years ago
- Decomposition Strategies for Vehicle Routing Heuristics☆32Updated 2 years ago
- Branch-and-price solver for the Feeder Network Design Problem☆37Updated 2 years ago
- Deep Learning Assisted Heuristic Tree Search for the Container Pre-marshalling Problem☆11Updated 6 years ago