andremaravilha / discorde-tsp
Discorde TSP is an easy-to-use API for Concorde TSP solver in C and C++ programming languages
☆18Updated 6 years ago
Alternatives and similar repositories for discorde-tsp:
Users that are interested in discorde-tsp are comparing it to the libraries listed below
- The CVRPSEP package is a collection of routines, written in the C++ programming language, for separation of various classes of cuts in br…☆21Updated 4 months ago
- Bucket Graph Labeling Algorithm for Vehicle Routing☆13Updated this week
- A C++ Framework for Optimization☆27Updated this week
- Set Partitioning Heuristic (SPH) based on CPLEX MILP solver and created starting from the CFT Heuristic implemented by Accorsi Luca and C…☆14Updated 11 months ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆11Updated 2 years ago
- A Julia interface for VRPSolver☆13Updated last year
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem☆15Updated 3 months ago
- Fork of the Concorde TSP solver with an easier build procedure☆11Updated 8 months ago
- A solver based on column generation☆24Updated this week
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆25Updated 2 years ago
- A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems☆16Updated last year
- Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…☆16Updated last year
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆45Updated 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…☆15Updated 5 years ago
- It's the implementation for "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems"☆15Updated 6 months ago
- RouteOpt☆23Updated last month
- Feasibility Jump☆23Updated last year
- Decomposition Strategies for Vehicle Routing Heuristics☆25Updated last year
- Branch-Cut-Price Framework☆27Updated 4 years ago
- Presentation: Custom MIP Heuristics☆32Updated 3 years ago
- ☆13Updated 9 months ago
- A set of reusable components for fast prototyping CVRP heuristic solution approaches.☆16Updated last week
- A matheuristic approach for the Capacitated Vehicle Routing Problem☆49Updated 2 years ago
- Elementary branch-price-and-cut algorithm for the vehicle routing problem with stochastic demands under optimal restocking☆14Updated last year
- ☆13Updated 7 months ago
- Source code associated with the paper: "Vidal, T., Martinelli, R., Pham, T. A., & Hà, M. H. (2021). Arc routing with time-dependent trave…☆17Updated 4 years ago
- OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.☆16Updated last year
- Solving a TSP with the CPLEX C++ API.☆50Updated 4 years ago
- A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem☆15Updated last year
- A Julia wrapper for the Concorde TSP Solver.☆13Updated 8 months ago