Originally posted by: SystemAdmin
Dear All,
I'm doing my research on Location-routing problem by using branch and price (exact solution). I tried to use purely OPL by following Cutting stock problem example (I used Shortest path on sub-problem). However, I realised that the column could not be added on the fly. After review for the solutions, I (think) have only 2 options.
1. Start on C++ and borrow CPLEX library (like cutstock.cpp)
2. Use other framework i.e. ABACUS, BCP, MINTO, SCIP, or Symphony
I have zero knowledge on those two. Could you recommend which approach should I go. Your suggestions are highly appreciated
Best,
Tong
#CPLEXOptimizers#DecisionOptimization