Posted By
O. A.
Thu May 07, 2020 05:24 AM
Found In
Egroup:
Decision Optimization
\
view thread
Hi, I am looking into finding alternative optimal (or near-optimal) solutions to a MILP by adding combinatorial Benders type cuts that eliminate an optimal solution once it is found. I was wondering what method is the most efficient for achieving this using Python API? Should I be using callbacks ...
|