Section: Software

Primal heuristics for general mixed integer programs

Beside the MIP heuristic developped in a decomposition framework (see 5.2 ), our team has been working on is the a new family of randomized rounding heurisitics for MIP problems with general integer variables (i.e., not necessarily binary) [132] . We have extensively tested these heuristics within the COIN-OR suite of optimization software [46] , and it is our intent to incorporate them within this suite as part of the module CBC [45] in the near future.