Implementation of a Branch-and-Cut Algortihm for a Dial-a-Ride Problem with the CPLEX JAVA API.
-
Updated
Mar 3, 2020 - Java
Implementation of a Branch-and-Cut Algortihm for a Dial-a-Ride Problem with the CPLEX JAVA API.
A simple Travelling Salesman Problem to solve (optimize) with Java and IBM Cplex - For Learning Purposes
A tool to enlarge a focus region in a road map while minimizing the distortion by convex quadratic programming.
Final code of the "Lane-based Signal Optimization with Left Turn Prohibition in Urban Road Networks"
Cplex implementation of the mathematical model in Java developed for single-member district electoral district
Scholar project (Ph.D. Laval University): statistical analysis of heuristics and Cplex models
Comparison of different LP formulations for the NP-hard 1 | prec | sum C_j scheduling problem
Add a description, image, and links to the cplex topic page so that developers can more easily learn about it.
To associate your repository with the cplex topic, visit your repo's landing page and select "manage topics."