heur_dualval.h File Reference

Detailed Description

primal heuristic that uses dualvalues for successive switching variable values

Author

Tobias Buchwald

This heuristic tries to find solutions by taking the LP or NLP, rounding solution values, fixing the variables to the rounded values and then changing some of the values.To determine which variable is changed we give each variable a ranking dependent on its dualvalue. We work with a transformed problem that is always feasible and has objective = 0 iff the original problem is also feasible. Thus we cannot expect to find really good solutions.

Definition in file heur_dualval.h.

#include "scip/scip.h"

Go to the source code of this file.

Functions
SCIP_RETCODE	SCIPincludeHeurDualval (SCIP *scip)
SCIP_RETCODE	SCIPapplyHeurDualval (SCIP *scip, SCIP_HEUR *heur, SCIP_RESULT *result, SCIP_SOL *refpoint)

Function Documentation

SCIP_RETCODE SCIPincludeHeurDualval

(

SCIP *

scip

)

creates the dualVal primal heuristic and includes it in SCIP

Parameters

scip	SCIP data structure

SCIP_RETCODE SCIPapplyHeurDualval	(	SCIP *	scip,
		SCIP_HEUR *	heur,
		SCIP_RESULT *	result,
		SCIP_SOL *	refpoint
	)

main procedure of the dualval heuristic

Parameters

scip	original SCIP data structure
heur	heuristic data structure
result	pointer to store result of: did not run, solution found, no solution found, or fixing is infeasible (cutoff)
refpoint	point to take fixation of discrete variables from; if NULL, then LP solution is used