scippp::params::HEURISTICS::FEASPUMP Namespace Reference

Parameters with prefix heuristics/feaspump. More...

Variables
constexpr Param< double >	ALPHA { "heuristics/feaspump/alpha" }
	initial weight of the objective function in the convex combination
constexpr Param< double >	ALPHADIFF { "heuristics/feaspump/alphadiff" }
	threshold difference for the convex parameter to perform perturbation
constexpr Param< bool >	BEFORECUTS { "heuristics/feaspump/beforecuts" }
	should the feasibility pump be called at root node before cut separation?
constexpr Param< bool >	COPYCUTS { "heuristics/feaspump/copycuts" }
	should all active cuts from cutpool be copied to constraints in subproblem?
constexpr Param< int >	CYCLELENGTH { "heuristics/feaspump/cyclelength" }
	maximum length of cycles to be checked explicitly in each round
constexpr Param< int >	FREQ { "heuristics/feaspump/freq" }
	frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
constexpr Param< int >	FREQOFS { "heuristics/feaspump/freqofs" }
	frequency offset for calling primal heuristic <feaspump>
constexpr Param< int >	MAXDEPTH { "heuristics/feaspump/maxdepth" }
	maximal depth level to call primal heuristic <feaspump> (-1: no limit)
constexpr Param< int >	MAXLOOPS { "heuristics/feaspump/maxloops" }
	maximal number of pumping loops (-1: no limit)
constexpr Param< int >	MAXLPITEROFS { "heuristics/feaspump/maxlpiterofs" }
	additional number of allowed LP iterations
constexpr Param< double >	MAXLPITERQUOT { "heuristics/feaspump/maxlpiterquot" }
	maximal fraction of diving LP iterations compared to node LP iterations
constexpr Param< int >	MAXSOLS { "heuristics/feaspump/maxsols" }
	total number of feasible solutions found up to which heuristic is called (-1: no limit)
constexpr Param< int >	MAXSTALLLOOPS { "heuristics/feaspump/maxstallloops" }
	maximal number of pumping rounds without fractionality improvement (-1: no limit)
constexpr Param< int >	MINFLIPS { "heuristics/feaspump/minflips" }
	minimum number of random variables to flip, if a 1-cycle is encountered
constexpr Param< int >	NEIGHBORHOODSIZE { "heuristics/feaspump/neighborhoodsize" }
	radius (using Manhattan metric) of the neighborhood to be searched in stage 3
constexpr Param< double >	OBJFACTOR { "heuristics/feaspump/objfactor" }
	factor by which the regard of the objective is decreased in each round, 1.0 for dynamic
constexpr Param< bool >	PERTSOLFOUND { "heuristics/feaspump/pertsolfound" }
	should a random perturbation be performed if a feasible solution was found?
constexpr Param< int >	PERTURBFREQ { "heuristics/feaspump/perturbfreq" }
	number of iterations until a random perturbation is forced
constexpr Param< int >	PRIORITY { "heuristics/feaspump/priority" }
	priority of heuristic <feaspump>
constexpr Param< bool >	STAGE3 { "heuristics/feaspump/stage3" }
	should we solve a local branching sub-MIP if no solution could be found?
constexpr Param< bool >	USEFP20 { "heuristics/feaspump/usefp20" }
	should an iterative round-and-propagate scheme be used to find the integral points?

Detailed Description

Parameters with prefix heuristics/feaspump.

Variable Documentation

ALPHA

constexpr Param<double> scippp::params::HEURISTICS::FEASPUMP::ALPHA { "heuristics/feaspump/alpha" }

constexpr

initial weight of the objective function in the convex combination

Definition at line 2931 of file parameters.hpp.

ALPHADIFF

constexpr Param<double> scippp::params::HEURISTICS::FEASPUMP::ALPHADIFF { "heuristics/feaspump/alphadiff" }

constexpr

threshold difference for the convex parameter to perform perturbation

Definition at line 2933 of file parameters.hpp.

BEFORECUTS

constexpr Param<bool> scippp::params::HEURISTICS::FEASPUMP::BEFORECUTS { "heuristics/feaspump/beforecuts" }

constexpr

should the feasibility pump be called at root node before cut separation?

Definition at line 2951 of file parameters.hpp.

COPYCUTS

constexpr Param<bool> scippp::params::HEURISTICS::FEASPUMP::COPYCUTS { "heuristics/feaspump/copycuts" }

constexpr

should all active cuts from cutpool be copied to constraints in subproblem?

Definition at line 2959 of file parameters.hpp.

CYCLELENGTH

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::CYCLELENGTH { "heuristics/feaspump/cyclelength" }

constexpr

maximum length of cycles to be checked explicitly in each round

Definition at line 2945 of file parameters.hpp.

FREQ

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::FREQ { "heuristics/feaspump/freq" }

constexpr

frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)

Definition at line 2921 of file parameters.hpp.

FREQOFS

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::FREQOFS { "heuristics/feaspump/freqofs" }

constexpr

frequency offset for calling primal heuristic <feaspump>

Definition at line 2923 of file parameters.hpp.

MAXDEPTH

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::MAXDEPTH { "heuristics/feaspump/maxdepth" }

constexpr

maximal depth level to call primal heuristic <feaspump> (-1: no limit)

Definition at line 2925 of file parameters.hpp.

MAXLOOPS

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::MAXLOOPS { "heuristics/feaspump/maxloops" }

constexpr

maximal number of pumping loops (-1: no limit)

Definition at line 2939 of file parameters.hpp.

MAXLPITEROFS

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::MAXLPITEROFS { "heuristics/feaspump/maxlpiterofs" }

constexpr

additional number of allowed LP iterations

Definition at line 2935 of file parameters.hpp.

MAXLPITERQUOT

constexpr Param<double> scippp::params::HEURISTICS::FEASPUMP::MAXLPITERQUOT { "heuristics/feaspump/maxlpiterquot" }

constexpr

maximal fraction of diving LP iterations compared to node LP iterations

Definition at line 2927 of file parameters.hpp.

MAXSOLS

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::MAXSOLS { "heuristics/feaspump/maxsols" }

constexpr

total number of feasible solutions found up to which heuristic is called (-1: no limit)

Definition at line 2937 of file parameters.hpp.

MAXSTALLLOOPS

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::MAXSTALLLOOPS { "heuristics/feaspump/maxstallloops" }

constexpr

maximal number of pumping rounds without fractionality improvement (-1: no limit)

Definition at line 2941 of file parameters.hpp.

MINFLIPS

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::MINFLIPS { "heuristics/feaspump/minflips" }

constexpr

minimum number of random variables to flip, if a 1-cycle is encountered

Definition at line 2943 of file parameters.hpp.

NEIGHBORHOODSIZE

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::NEIGHBORHOODSIZE { "heuristics/feaspump/neighborhoodsize" }

constexpr

radius (using Manhattan metric) of the neighborhood to be searched in stage 3

Definition at line 2949 of file parameters.hpp.

OBJFACTOR

constexpr Param<double> scippp::params::HEURISTICS::FEASPUMP::OBJFACTOR { "heuristics/feaspump/objfactor" }

constexpr

factor by which the regard of the objective is decreased in each round, 1.0 for dynamic

Definition at line 2929 of file parameters.hpp.

PERTSOLFOUND

constexpr Param<bool> scippp::params::HEURISTICS::FEASPUMP::PERTSOLFOUND { "heuristics/feaspump/pertsolfound" }

constexpr

should a random perturbation be performed if a feasible solution was found?

Definition at line 2955 of file parameters.hpp.

PERTURBFREQ

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::PERTURBFREQ { "heuristics/feaspump/perturbfreq" }

constexpr

number of iterations until a random perturbation is forced

Definition at line 2947 of file parameters.hpp.

PRIORITY

constexpr Param<int> scippp::params::HEURISTICS::FEASPUMP::PRIORITY { "heuristics/feaspump/priority" }

constexpr

priority of heuristic <feaspump>

Definition at line 2919 of file parameters.hpp.

STAGE3

constexpr Param<bool> scippp::params::HEURISTICS::FEASPUMP::STAGE3 { "heuristics/feaspump/stage3" }

constexpr

should we solve a local branching sub-MIP if no solution could be found?

Definition at line 2957 of file parameters.hpp.

USEFP20

constexpr Param<bool> scippp::params::HEURISTICS::FEASPUMP::USEFP20 { "heuristics/feaspump/usefp20" }

constexpr

should an iterative round-and-propagate scheme be used to find the integral points?

Definition at line 2953 of file parameters.hpp.