heldstephan / exactcolorsLinks
Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.
☆13Updated last week
Alternatives and similar repositories for exactcolors
Users that are interested in exactcolors are comparing it to the libraries listed below
Sorting:
- A C++ Framework for Optimization☆35Updated last month
- A solver based on column generation☆30Updated 3 weeks ago
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆48Updated last year
- Bucket Graph Labeling Algorithm for Vehicle Routing☆19Updated 3 months ago
- Machine-learning-based column selection☆36Updated 3 years ago
- A set of reusable components for fast prototyping CVRP heuristic solution approaches.☆16Updated 7 months ago
- It's the implementation for "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems"☆21Updated last year
- RouteOpt☆47Updated 3 weeks ago
- Fork of the Concorde TSP solver with an easier build procedure☆15Updated last year
- A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem☆16Updated 2 years ago
- A matheuristic approach for the Capacitated Vehicle Routing Problem☆50Updated 3 years ago
- Set Partitioning Heuristic (SPH) based on CPLEX MILP solver and created starting from the CFT Heuristic implemented by Accorsi Luca and C…☆14Updated last year
- The CVRPSEP package is a collection of routines, written in the C++ programming language, for separation of various classes of cuts in br…☆21Updated 11 months ago
- Feasibility Jump☆27Updated last year
- Branch-and-Price Algorithm for the Bin Packing Problem (using CPLEX as pricer and LP solver). It implements a Ryan-Foster branching schem…☆16Updated 6 years ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆11Updated 3 years ago
- ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.☆70Updated last year
- Elementary Shortest Path Problem with Resource Constraints☆33Updated last year
- ☆12Updated last year
- Branch-Cut-Price Framework☆30Updated 4 years ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆29Updated 2 months ago
- A more scalable version of FILO.☆23Updated 5 months ago
- This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with …☆49Updated last year
- A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems☆18Updated 2 years ago
- Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…☆18Updated 2 years ago
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆145Updated 2 weeks ago
- Benders Decomposition for SAHLP☆11Updated last year
- OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.☆17Updated 2 years ago
- ☆17Updated 2 years ago
- A standalone local search solver for general integer linear programming☆16Updated 11 months ago