All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
pub_dive.h File Reference Detailed Descriptionlibrary methods for diving heuristics Definition in file pub_dive.h. #include "scip/scip.h" Go to the source code of this file.
Function Documentation
performs a diving within the limits of the diveset parameters This method performs a diving according to the settings defined by the diving settings Starting from the current LP solution, the algorithm selects candidates which maximize the score defined by the The algorithm iteratively selects the the next (unfixed) candidate in the list, until either enough domain changes or the resolve frequency of the LP trigger an LP resolve (and hence, the set of potential candidates changes), or the last node is proven to be infeasible. It optionally backtracks and tries the other branching direction. After the set of remaining candidates is empty or the targeted depth is reached, the node LP is solved, and the old candidates are replaced by the new LP candidates.
