Alternatives and similar repositories for tsppd-hybrid:

Users that are interested in tsppd-hybrid are comparing it to the libraries listed below

• coin-or / Bcp
  Branch-Cut-Price Framework
  ☆28Updated 4 years 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…
  ☆15Updated 5 years ago
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆23Updated last year
• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated 6 months ago
• fontanf / columngenerationsolver
  A solver based on column generation
  ☆26Updated this week
• inria-UFF / location-routing
  A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems
  ☆16Updated 2 years ago
• coin-or / Cgl
  Cut Generator Library
  ☆25Updated last month
• alberto-santini / maritime-vrp
  Branch-and-price solver for the Feeder Network Design Problem
  ☆34Updated last year
• shaowei-cai-group / Local-MIP
  A standalone local search solver for general mixed integer programming
  ☆18Updated last month
• quesnel / baryonyx
  binary/integer linear programming solver
  ☆15Updated last month
• vidalt / Split-Library
  Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …
  ☆16Updated 6 years ago
• Zhengzhong-You / RouteOpt
  RouteOpt
  ☆26Updated 2 months ago
• Lyxn / linprog
  Linear Programming in Short
  ☆18Updated 3 years ago
• hlefebvr / idol
  A C++ Framework for Optimization
  ☆30Updated last month
• acco93 / filo2
  A more scalable version of FILO.
  ☆20Updated last week
• vidalt / HGS-TDCARP
  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
• torressa / cspy
  A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
  ☆81Updated 7 months ago
• N-Wouda / Euro-NeurIPS-2022
  OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.
  ☆16Updated 2 years ago
• dparo / master-thesis
  A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
  ☆15Updated last year
• ryanjoneil / ap.cpp
  C++ implementation of an incremental primal-dual assignment problem solver.
  ☆12Updated last month
• alberto-santini / cvrp-decomposition
  Decomposition Strategies for Vehicle Routing Heuristics
  ☆27Updated last year
• Oscar-Oliveira / OR-Datasets
  Instance datasets of operations research problems.
  ☆18Updated 10 months ago
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆25Updated 2 years ago
• mouadmorabit / MLColumnSelection
  Machine-learning-based column selection
  ☆35Updated 3 years ago
• pathwyse / pathwyse
  PathWyse: a flexible, open-source library for the resource constrained shortest path problem
  ☆17Updated 5 months ago
• fabiofurini / LocationCovering
  Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem
  ☆14Updated last year
• tumBAIS / RoutingBlocks
  A modular Python package for the development of metaheuristic algorithms for Vehicle Routing Problems with Intermediate Stops
  ☆19Updated last year
• coin-or / MibS
  A solver for mixed integer bilevel programs
  ☆50Updated this week
• tumBAIS / euro-meets-neurips-2022
  ☆40Updated 7 months ago
• coin-or / Dip
  DIP is a decomposition-based solver framework for mixed integer linear programs.
  ☆19Updated 4 years ago