heldstephan / exactcolors
Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.
☆13Updated 2 years ago
Alternatives and similar repositories for exactcolors:
Users that are interested in exactcolors are comparing it to the libraries listed below
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆45Updated last year
- A set of reusable components for fast prototyping CVRP heuristic solution approaches.☆16Updated 2 months ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆25Updated 2 years ago
- Bucket Graph Labeling Algorithm for Vehicle Routing☆15Updated this week
- A C++ Framework for Optimization☆31Updated this week
- ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.☆64Updated 8 months ago
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆130Updated last month
- This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with …☆48Updated 11 months ago
- RouteOpt☆26Updated 3 months ago
- Elementary branch-price-and-cut algorithm for the vehicle routing problem with stochastic demands under optimal restocking☆14Updated last year
- Source code associated with the paper: "Vidal, T., Martinelli, R., Pham, T. A., & Hà, M. H. (2021). Arc routing with time-dependent trave…☆18Updated 4 years ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆11Updated 3 years ago
- A tutorial on using C++/Cplex for OR problems. The tutorial is intended to be useful for every OR practitioner with an intermediary knowl…☆39Updated 3 years ago
- A solver based on column generation☆26Updated 2 weeks ago
- Machine-learning-based column selection☆35Updated 3 years ago
- Elementary Shortest Path Problem with Resource Constraints☆31Updated 7 months ago
- A matheuristic approach for the Capacitated Vehicle Routing Problem☆49Updated 2 years ago
- Benders Decomposition for SAHLP☆11Updated last year
- Working project: Learn VRP by coding☆21Updated last week
- Feasibility Jump☆25Updated 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 last year
- A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems☆16Updated 2 years ago
- Branch-Cut-Price Framework☆28Updated 4 years ago
- A more scalable version of FILO.☆20Updated 2 weeks ago
- It's the implementation for "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems"☆18Updated 8 months ago
- The CVRPSEP package is a collection of routines, written in the C++ programming language, for separation of various classes of cuts in br…☆21Updated 6 months ago
- Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…☆17Updated 2 years ago
- column generation + ESPPRC + pulse algorithm☆29Updated 5 years ago
- Fork of the Concorde TSP solver with an easier build procedure☆12Updated 10 months ago
- Source code for branch and bound based train timetabling algorithms, for paper titled: Single-track train timetabling with guaranteed opt…☆10Updated 4 years ago