Alternatives and similar repositories for ISCO-spring-school

Users that are interested in ISCO-spring-school are comparing it to the libraries listed below

• mtanneau / or_tutorials
  Tutorial on Benders decomposition and acceleration techniques
  ☆16Updated 2 years ago
• ed-lam / nutmeg
  Nutmeg – a MIP and CP branch-and-check solver
  ☆26Updated 2 years ago
• ambros-gleixner / MIPcc23
  The MIP Workshop 2023 Computational Competition
  ☆40Updated last year
• hwiberg / OptiCL
  An end-to-end framework for mixed-integer optimization with data-driven learned constraints.
  ☆128Updated last year
• Gurobi / pres-mipheur
  Presentation: Custom MIP Heuristics
  ☆34Updated 3 years ago
• AustinLBuchanan / Combinatorial-Optimization-in-Gurobi
  Combinatorial Optimization in Gurobi
  ☆44Updated 2 years ago
• dchetelat / subadditive
  ☆18Updated 2 years ago
• lzw37 / DecompositionAlgorithm
  Large scale decomposition algorithm (Lagrangian relaxation, Benders decomposition & Column generation) for CDN communication network.
  ☆11Updated 7 years ago
• GregorCH / ipet
  Interactive Performance Evaluation Tools for Optimization Software
  ☆28Updated last year
• khalil-research / Neur2RO
  ☆27Updated 8 months ago
• bstellato / mlopt
  The Machine Learning Optimizer
  ☆105Updated 2 years ago
• Pyomo / pyomo-model-libraries
  Libraries of Pyomo test problems
  ☆24Updated this week
• lingquant / msppy
  ☆51Updated 4 years ago
• jiedxu / BendersOptim
  Benders decomposition to solve mixed integer linear programming, especially stochastic programming in seconds!
  ☆24Updated 6 years ago
• torressa / cspy
  A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
  ☆86Updated last year
• alberto-santini / concorde-easy-build
  Fork of the Concorde TSP solver with an easier build procedure
  ☆15Updated last year
• ANL-CEEESA / MIPLearn
  Framework for solving discrete optimization problems using a combination of Mixed-Integer Linear Programming (MIP) and Machine Learning (…
  ☆173Updated 2 weeks ago
• atoptima / Coluna.jl
  Branch-and-Price-and-Cut in Julia
  ☆203Updated 3 weeks ago
• hlefebvr / idol
  A C++ Framework for Optimization
  ☆36Updated 3 weeks ago
• alexforel / Explainable-CSO
  Code for "Explainable Data-Driven Optimization" (ICML 2023)
  ☆14Updated 2 years ago
• corail-research / SeaPearl.jl
  Julia hybrid constraint programming solver enhanced by a reinforcement learning driven search.
  ☆167Updated last year
• rtm2130 / SPOTree
  ☆33Updated 4 years ago
• GioniMexi / FeasPumpCollection
  Feasibility Pump Collection
  ☆13Updated 2 years ago
• AustinLBuchanan / TSP_VRP
  Python codes for the traveling salesman problem and vehicle routing problem
  ☆67Updated 3 years ago
• mattmilten / TreeD
  Visual representation of the branch-and-cut tree of SCIP using spatial dissimilarities of LP solutions
  ☆28Updated 3 years ago
• coin-or / GrUMPy
  A Python library for visualizing algorithms for solving mathematical optimization problems.
  ☆65Updated 4 years ago
• 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…
  ☆19Updated 5 years ago
• matbesancon / SimpleBenders.jl
  A simple implementation of the Benders decomposition method with JuMP
  ☆11Updated 2 years ago
• mattmilten / mittelmann-plots
  Visualizations of Mittelmann benchmarks
  ☆59Updated last week
• demirayonur / Column-Generation
  Column generation (theory + python implementation)
  ☆30Updated 4 years ago