cvneves / kit-optLinks
☆11Updated 2 months ago
Alternatives and similar repositories for kit-opt
Users that are interested in kit-opt are comparing it to the libraries listed below
Sorting:
- ☆13Updated 4 years ago
- A branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP)☆28Updated 3 years ago
- Inventory-routing problem (IRP) branch-and-cut algorithm using C++ Gurobi's API and CVRPSEP package☆15Updated 4 years ago
- Example code for using CPLEX and Java.☆24Updated 2 years ago
- Implementation of Integer bender's cut for SP proposed by Laporte et al.☆11Updated 6 years ago
- A matheuristic approach for the Capacitated Vehicle Routing Problem☆51Updated 3 years ago
- A collection of notable optimization problems solved with AMPL.☆13Updated 8 years ago
- Large scale decomposition algorithm (Lagrangian relaxation, Benders decomposition & Column generation) for CDN communication network.☆11Updated 7 years ago
- Accompanying code for the text: Maniezzo, Vittorio, Boschetti, Marco Antonio, Stützle, Thomas "Matheuristics, algorithms and implementati…☆18Updated last year
- Adaptive Large Neighbourhood Search for the Orienteering Problem☆11Updated 2 years ago
- A tutorial on using C++/Cplex for OR problems. The tutorial is intended to be useful for every OR practitioner with an intermediary knowl…☆41Updated 4 years ago
- A Python implementation of Tabu Search Algorithm for the Traveling Salesman Problem☆19Updated 6 years ago
- Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem☆18Updated 2 years ago
- Tutorial on Benders decomposition and acceleration techniques☆16Updated 2 years ago
- ☆30Updated 11 years ago
- Source code associated with the paper: "Vidal, T., Martinelli, R., Pham, T. A., & Hà, M. H. (2021). Arc routing with time-dependent trave…☆20Updated 5 years ago
- Material de Otimização/Programação Não Linear em Julia☆27Updated 4 years ago
- Tabu Search heuristic for Travelling Salesperson Problems with Profits☆11Updated 7 years ago
- ☆20Updated 3 weeks ago
- Solving a TSP with the CPLEX C++ API.☆50Updated 5 years ago
- 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
- Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …☆20Updated 7 years ago
- Solving Elementary Longest/Shortest Path problems with Integer Programming☆14Updated 8 years ago
- It is a study guide for people who are interested in learning Mixed Integer Programming. The repository contains a set of classical optim…☆11Updated last year
- Adaptive Heuristic Method Based on SA and LNS for Solving Vehicle Routing Problem☆13Updated 8 years ago
- NLNS+VND Metaheuristic Algorithm for solving Combinatorial Optimization Problems☆10Updated 8 years ago
- ☆15Updated 8 years ago
- A python implementation for simplex method☆60Updated 4 years ago
- Job Shop Scheduling Problem Solver☆15Updated 6 years ago
- Exact algorithm implementation based on Cplex Java API☆18Updated 5 years ago