In his blog post K Best Solutions
, Paul Rubin provides some information on how to obtain the K best
solutions for a MIP model. One of the approaches he discusses is the solution pool functionality of CPLEX. In this article, we demonstrate how to use the solution pool feature of CPLEX in AIMMS using the the same binary knapsack problem used by Paul.
Find out more, here