heur_dualval.h
Go to the documentation of this file.
30 * This heuristic tries to find solutions by taking the LP or NLP, rounding solution values, fixing the variables to the
31 * rounded values and then changing some of the values.To determine which variable is changed we give each variable a
32 * ranking dependent on its dualvalue. We work with a transformed problem that is always feasible and has objective = 0
33 * iff the original problem is also feasible. Thus we cannot expect to find really good solutions.
36 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
SCIP_RETCODE SCIPapplyHeurDualval(SCIP *scip, SCIP_HEUR *heur, SCIP_RESULT *result, SCIP_SOL *refpoint)
Definition: heur_dualval.c:2016
type definitions for return codes for SCIP methods
Definition: struct_sol.h:73
type definitions for primal heuristics
type definitions for SCIP's main datastructure
Definition: struct_heur.h:97
type definitions for storing primal CIP solutions
result codes for SCIP callback methods
SCIP_RETCODE SCIPincludeHeurDualval(SCIP *scip)
Definition: heur_dualval.c:2788
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43