|
Branch-and-Cut-and-Heuristic Facility |
Top Previous Next |
|
Hard mixed-integer programming (MIP) problems can be solved faster with the help of user supplied routines that generate cutting planes and good integer feasible solutions.The GAMS Branch-and-Cut-and-Heuristic (BCH) facility closes this gap. It automates all major steps necessary to define, execute and control the use of user defined routines within the framework of general purpose MIP codes. It is documented at http://www.gams.com/docs/bch.htm. |