heur_dualval.h
Go to the documentation of this file.
21 * This heuristic tries to find solutions by taking the LP or NLP, rounding solution values, fixing the variables to the 22 * rounded values and then changing some of the values.To determine which variable is changed we give each variable a 23 * ranking dependent on its dualvalue. We work with a transformed problem that is always feasible and has objective = 0 24 * iff the original problem is also feasible. Thus we cannot expect to find really good solutions. 27 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
SCIP_RETCODE SCIPincludeHeurDualval(SCIP *scip) SCIP_RETCODE SCIPapplyHeurDualval(SCIP *scip, SCIP_HEUR *heur, SCIP_RESULT *result, SCIP_SOL *refpoint) Definition: objbranchrule.h:33 SCIP callable library. |