Detailed Description
Objective Feasibility Pump 2.0.
The fundamental idea of the Feasibility Pump is to construct two sequences of points which hopefully converge to a feasible solution. One sequence consists of LP-feasiblepoints, the other one of integer feasible points. They are produced by alternately rounding an LP-feasible point and solvng an LP that finds a point on the LP polyhedron which is closest to the rounded, integral point (w.r.t. Manhattan distance).
The version implemented in SCIP supports using an Objective Feasibility Pump that uses a convex combination of the Manhattan distance and the original LP objective for reoptimization. It further features Feasibility Pump 2.0 capabilities, hence propagating the fixings for a faster convergence.
Definition in file heur_gcgfeaspump.h.
#include "scip/scip.h"
Go to the source code of this file.
Functions | |
SCIP_EXPORT SCIP_RETCODE | SCIPincludeHeurGcgfeaspump (SCIP *scip) |
Function Documentation
◆ SCIPincludeHeurGcgfeaspump()
SCIP_EXPORT SCIP_RETCODE SCIPincludeHeurGcgfeaspump | ( | SCIP * | scip | ) |
creates the feaspump primal heuristic and includes it in SCIP
creates the gcgfeaspump primal heuristic and includes it in SCIP
Definition at line 1424 of file heur_gcgfeaspump.c.
References DEFAULT_ALPHADIFF, DEFAULT_COPYCUTS, DEFAULT_CYCLELENGTH, DEFAULT_MAXLOOPS, DEFAULT_MAXLPITEROFS, DEFAULT_MAXLPITERQUOT, DEFAULT_MAXSOLS, DEFAULT_MAXSTALLLOOPS, DEFAULT_MINFLIPS, DEFAULT_NEIGHBORHOODSIZE, DEFAULT_OBJFACTOR, DEFAULT_PERTSOLFOUND, DEFAULT_PERTURBFREQ, DEFAULT_STAGE3, DEFAULT_USEFP20, HEUR_DESC, HEUR_DISPCHAR, HEUR_FREQ, HEUR_FREQOFS, HEUR_MAXDEPTH, HEUR_NAME, HEUR_PRIORITY, HEUR_TIMING, and HEUR_USESSUBSCIP.
Referenced by SCIPincludeGcgPlugins().