Alternatives and similar repositories for GeCO:

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

• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated 8 months ago
• google-deepmind / neural_lns
  ☆44Updated 3 years ago
• lyeskhalil / mipGNN
  ☆24Updated 3 years ago
• pg2455 / Hybrid-learn2branch
  Hybrid Models for Learning to Branch (NeurIPS 2020)
  ☆49Updated 3 years ago
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆21Updated 2 years ago
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆24Updated last year
• hlefebvr / idol
  A C++ Framework for Optimization
  ☆33Updated last week
• ANL-CEEESA / MIPLearn
  Framework for solving discrete optimization problems using a combination of Mixed-Integer Linear Programming (MIP) and Machine Learning (…
  ☆166Updated 3 months ago
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆26Updated 2 years ago
• alberto-santini / concorde-easy-build
  Fork of the Concorde TSP solver with an easier build procedure
  ☆13Updated last year
• torressa / cspy
  A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
  ☆82Updated 9 months ago
• ambros-gleixner / MIPcc23
  The MIP Workshop 2023 Computational Competition
  ☆41Updated last year
• mattmilten / TreeD
  Visual representation of the branch-and-cut tree of SCIP using spatial dissimilarities of LP solutions
  ☆28Updated 2 years ago
• GregorCH / ipet
  Interactive Performance Evaluation Tools for Optimization Software
  ☆27Updated last year
• coin-or / Bcp
  Branch-Cut-Price Framework
  ☆28Updated 4 years ago
• avrech / learning2cut
  Reinforcement Learning for Cut Selection
  ☆11Updated 2 years ago
• inria-UFF / VRPSolverEasy
  A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems
  ☆137Updated 3 months ago
• ds4dm / branch-search-trees
  Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)
  ☆68Updated 3 years ago
• MIT-CAVE / rc-cli
  ☆49Updated 2 years ago
• alexforel / Explainable-CSO
  Code for "Explainable Data-Driven Optimization" (ICML 2023)
  ☆14Updated last year
• Gurobi / pres-mipheur
  Presentation: Custom MIP Heuristics
  ☆33Updated 3 years ago
• fontanf / columngenerationsolver
  A solver based on column generation
  ☆30Updated last week
• shaowei-cai-group / Local-MIP
  A standalone local search solver for general mixed integer programming
  ☆21Updated 3 weeks ago
• scipopt / PyGCGOpt
  Python interface and modeling environment for GCG
  ☆19Updated last month
• Zhengzhong-You / RouteOpt
  RouteOpt
  ☆36Updated this week
• tumBAIS / euro-meets-neurips-2022
  ☆45Updated 9 months ago
• mouadmorabit / MLColumnSelection
  Machine-learning-based column selection
  ☆35Updated 3 years ago
• acco93 / filo
  A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.
  ☆48Updated last year
• fabiofurini / LocationCovering
  Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem
  ☆15Updated last year
• chkwon / PyHygese
  A Python wrapper for the Hybrid Genetic Search algorithm for Capacitated Vehicle Routing Problems (HGS-CVRP)
  ☆90Updated 2 years ago