gmarciani / amplitudeLinks
A collection of notable optimization problems solved with AMPL.
☆13Updated 7 years ago
Alternatives and similar repositories for amplitude
Users that are interested in amplitude are comparing it to the libraries listed below
Sorting:
- Exact algorithm implementation based on Cplex Java API☆18Updated 5 years ago
- ☆13Updated 4 years ago
- Example code for using CPLEX and Java.☆24Updated 2 years ago
- ☆30Updated 11 years ago
- Implementation of Integer bender's cut for SP proposed by Laporte et al.☆11Updated 5 years ago
- Large scale decomposition algorithm (Lagrangian relaxation, Benders decomposition & Column generation) for CDN communication network.☆11Updated 7 years ago
- Branch-and-price solver for the Feeder Network Design Problem☆36Updated 2 years ago
- Inventory-routing problem (IRP) branch-and-cut algorithm using C++ Gurobi's API and CVRPSEP package☆14Updated 4 years ago
- Adaptive Large Neighbourhood Search for the Orienteering Problem☆11Updated 2 years ago
- Combinatorial Optimization in Gurobi☆44Updated 2 years ago
- Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem☆15Updated 2 years ago
- Tabu Search heuristic for Travelling Salesperson Problems with Profits☆11Updated 6 years ago
- A public bookmark bar. Resources for computation, operations research, academia, and more.☆58Updated 3 years ago
- Decision Optimization with OPL-CPLEX samples☆10Updated 8 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…☆19Updated 5 years ago
- Repository for the MIT course 15.S60 "Software Tools for Operations Research"☆22Updated 9 years ago
- Some lecture notes of Operations Research (usually taught in Junior year of BS) can be found in this repository along with some Python pr…☆139Updated 6 years ago
- A Python implementation of Tabu Search Algorithm for the Traveling Salesman Problem☆19Updated 6 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
- Introduction to Operations Research☆101Updated 6 years ago
- Implementation of a Branch-and-Cut Algortihm for a Dial-a-Ride Problem with the CPLEX JAVA API.☆22Updated 5 years ago
- Project for Stochastic Programming☆21Updated 7 years ago
- Provides fully configure Visual Studio Solution for ORTools☆10Updated 5 years ago
- This is the Web site associated with the repository for hosting software and data associated with papers appearing in the INFORMS Journal…☆19Updated 3 weeks ago
- A solver based on column generation☆30Updated 2 weeks ago
- PySP: Stochastic Programming in Python☆42Updated 4 years ago
- Using advanced MIP decomposition techniques like Column Generation, Benders' Decomposition, Lagrangian Relaxation to solve CVRP and UFL w…☆50Updated 5 years ago
- Tutorial on Benders decomposition and acceleration techniques☆16Updated 2 years ago
- Codes for the book "Julia Programming for Operations Research"☆196Updated 4 years ago
- Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …☆19Updated 6 years ago