randomized LP rounding heuristic which also generates conflicts via an auxiliary probing tree
Randomized LP rounding uses a random variable from a uniform distribution over [0,1] to determine whether the fractional LP value x should be rounded up with probability x - floor(x) or down with probability ceil(x) - x.
This implementation uses domain propagation techniques to tighten the variable domains after every rounding step.
- See also
- : The most relevant publication is Raghavan & Thompson, "Randomized rounding: A technique for provably good algorithms and algorithmic proofs", Combinatorica 7 (4): 365–374 1987
Definition in file heur_randrounding.h.
|SCIP_RETCODE||SCIPincludeHeurRandrounding (SCIP *scip)|