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.
  ☆12Updated 3 years ago
• hlefebvr / idol
  A C++ Framework for Optimization
  ☆36Updated 2 weeks ago
• fontanf / localsearchsolver
  A solver based on local search
  ☆13Updated 2 months ago
• fontanf / columngenerationsolver
  A solver based on column generation
  ☆36Updated last month
• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated last year
• cvneves / ILS-SP-CVRP
  A matheuristic approach for the Capacitated Vehicle Routing Problem
  ☆51Updated 3 years ago
• GioniMexi / FeasPumpCollection
  Feasibility Pump Collection
  ☆16Updated 2 years ago
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆34Updated 8 months ago
• acco93 / filo
  A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.
  ☆51Updated 2 years ago
• acco93 / cobra
  A set of reusable components for fast prototyping CVRP heuristic solution approaches.
  ☆19Updated 4 months 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
• lseman / baldes
  Bucket Graph Labeling Algorithm for Vehicle Routing
  ☆20Updated 9 months ago
• coin-or / Bcp
  Branch-Cut-Price Framework
  ☆30Updated 5 years ago
• shaowei-cai-group / Local-MIP
  A standalone local search solver for general mixed integer programming
  ☆34Updated 2 weeks ago
• SINTEF / feasibilityjump
  Feasibility Jump
  ☆29Updated 2 years ago
• pathwyse / pathwyse
  PathWyse: a flexible, open-source library for the resource constrained shortest path problem
  ☆26Updated 6 months ago
• alberto-santini / adaptive-large-neighbourhood-search
  ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.
  ☆76Updated last year
• Pigzaum / cg_cvrp
  A column generation algorithm (CG) for the capacitated vehicle routing problem (CVRP)
  ☆17Updated 3 years 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
• acco93 / filo2
  A more scalable version of FILO.
  ☆29Updated 4 months ago
• fabiofurini / B-P_BinPackingProblem
  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
• N-Wouda / Euro-NeurIPS-2022
  OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.
  ☆17Updated 3 years ago
• OptimizingWithColumnGeneration / OptimizingWithColumnGeneration.github.io
  ☆23Updated 9 months 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 2 years ago
• mattmilten / TreeD
  Visual representation of the branch-and-cut tree of SCIP using spatial dissimilarities of LP solutions
  ☆29Updated 3 years ago
• INFORMSJoC / 2023.0106
  ☆13Updated last year
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆31Updated 2 years ago
• tumBAIS / RoutingBlocks
  A modular Python package for the development of metaheuristic algorithms for Vehicle Routing Problems with Intermediate Stops
  ☆28Updated last year
• laser-ufpb / CVRPController
  CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.
  ☆24Updated 3 years ago
• alberto-santini / concorde-easy-build
  Fork of the Concorde TSP solver with an easier build procedure
  ☆15Updated last year