Alternatives and similar repositories for cft

Users that are interested in cft are comparing it to the libraries listed below

• c4v4 / LKH-SP
  Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.
  ☆13Updated 4 years ago
• hlefebvr / idol
  A C++ Framework for Optimization
  ☆36Updated this week
• fontanf / localsearchsolver
  A solver based on local search
  ☆14Updated 3 months ago
• fontanf / columngenerationsolver
  A solver based on column generation
  ☆39Updated last month
• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated last year
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆35Updated 9 months ago
• GioniMexi / FeasPumpCollection
  Feasibility Pump Collection
  ☆16Updated 2 years ago
• acco93 / cobra
  A set of reusable components for fast prototyping CVRP heuristic solution approaches.
  ☆19Updated 6 months ago
• JonasTollenaere / sparrow-3d
  A 3D adaptation of the state-of-the-art sparrow nesting algorithm
  ☆21Updated 2 months ago
• cvneves / ILS-SP-CVRP
  A matheuristic approach for the Capacitated Vehicle Routing Problem
  ☆51Updated 3 years ago
• coin-or / Bcp
  Branch-Cut-Price Framework
  ☆31Updated 5 years ago
• acco93 / filo
  A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.
  ☆51Updated 2 years ago
• c4v4 / sph
  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
• SINTEF / feasibilityjump
  Feasibility Jump
  ☆29Updated 2 years ago
• shaowei-cai-group / Local-MIP
  A standalone local search solver for general mixed integer programming
  ☆45Updated last month
• scipopt / papilo
  Parallel Presolve for Integer and Linear Optimization
  ☆84Updated last week
• pathwyse / pathwyse
  PathWyse: a flexible, open-source library for the resource constrained shortest path problem
  ☆28Updated 7 months ago
• lseman / baldes
  Bucket Graph Labeling Algorithm for Vehicle Routing
  ☆20Updated 11 months ago
• andremaravilha / discorde-tsp
  Discorde TSP is an easy-to-use API for Concorde TSP solver in C and C++ programming languages
  ☆20Updated 7 years ago
• N-Wouda / Euro-NeurIPS-2022
  OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.
  ☆17Updated 3 years ago
• alberto-santini / adaptive-large-neighbourhood-search
  ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.
  ☆78Updated last year
• alberto-santini / concorde-easy-build
  Fork of the Concorde TSP solver with an easier build procedure
  ☆15Updated last year
• nagata-yuichi / GA-EAX
  A genetic algorithm using Edge Assembly Crossover for the traveling salesman problem
  ☆39Updated 4 years ago
• dominiqs81 / MIPcc24
  MIP 2024 Computational Competition
  ☆18Updated 2 years ago
• martsime / hybridcvrp
  HybridCVRP: A Hybrid Metaheuristic Solver for the Capacitated Vehicle Routing Problem
  ☆28Updated 3 years ago
• acco93 / filo2
  A more scalable version of FILO.
  ☆31Updated 3 weeks ago
• coin-or / MibS
  A solver for mixed integer bilevel programs
  ☆60Updated 3 weeks ago
• vidalt / PDTSP
  Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…
  ☆19Updated 3 years ago
• alberto-santini / cvrp-decomposition
  Decomposition Strategies for Vehicle Routing Heuristics
  ☆32Updated 2 years ago
• d-krupke / cpsat-autotune
  WIP: Tune the hyperparameters of Google's OR-Tools' CP-SAT solver for specific models
  ☆22Updated 4 months ago