Skip to content

Release v1.3.2

Compare
Choose a tag to compare
@islerfab islerfab released this 19 Jan 08:16
· 65 commits to develop since this release

Improvements:

Added new modes to use the CPLEX solution pool to find k-best solutions:

  • Mode 3: Given a set of variables of interest (e.g., allocation variables in an Auction), CPLEX sequentially looks for a new solution by excluding the old one via constraints. Currently, this works only with binary variables of interest and is inefficient because CPLEX throws away the knowledge of the previous rounds and resolves the whole problem. However, it is a straight-forward way to be sure to get the k best solutions.
  • Mode 4: Implements an algorithm that has been developed together with Daniel Junglas from the CPLEX team to use the power of CPLEX to efficiently find the k-best solutions in a solution pool (this feature does not exist natively in CPLEX). This is the recommended way to find the k-best solutions of a problem, and also supports setting variables of interest of any type.