Parameters with prefix heuristics/undercover. More...

Variables
constexpr Param< bool >	BEFORECUTS { "heuristics/undercover/beforecuts" }
	should the heuristic be called at root node before cut separation?

constexpr Param< double >	CONFLICTWEIGHT { "heuristics/undercover/conflictweight" }
	weight for conflict score in fixing order

constexpr Param< bool >	COPYCUTS { "heuristics/undercover/copycuts" }
	should all active cuts from cutpool be copied to constraints in subproblem?

constexpr Param< bool >	COVERAND { "heuristics/undercover/coverand" }
	should and constraints be covered (or just copied)?

constexpr Param< bool >	COVERBD { "heuristics/undercover/coverbd" }
	should bounddisjunction constraints be covered (or just copied)?

constexpr Param< bool >	COVERIND { "heuristics/undercover/coverind" }
	should indicator constraints be covered (or just copied)?

constexpr Param< char >	COVERINGOBJ { "heuristics/undercover/coveringobj" }
	objective function of the covering problem (influenced nonlinear 'c'onstraints/'t'erms, 'd'omain size, 'l'ocks, 'm'in of up/down locks, 'u'nit penalties)

constexpr Param< bool >	COVERNL { "heuristics/undercover/covernl" }
	should nonlinear constraints be covered (or just copied)?

constexpr Param< double >	CUTOFFWEIGHT { "heuristics/undercover/cutoffweight" }
	weight for cutoff score in fixing order

constexpr Param< std::string >	FIXINGALTS { "heuristics/undercover/fixingalts" }
	prioritized sequence of fixing values used ('l'p relaxation, 'n'lp relaxation, 'i'ncumbent solution)

constexpr Param< char >	FIXINGORDER { "heuristics/undercover/fixingorder" }
	order in which variables should be fixed (increasing 'C'onflict score, decreasing 'c'onflict score, increasing 'V'ariable index, decreasing 'v'ariable index

constexpr Param< bool >	FIXINTFIRST { "heuristics/undercover/fixintfirst" }
	should integer variables in the cover be fixed first?

constexpr Param< int >	FREQ { "heuristics/undercover/freq" }
	frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)

constexpr Param< int >	FREQOFS { "heuristics/undercover/freqofs" }
	frequency offset for calling primal heuristic <undercover>

constexpr Param< double >	INFERENCEWEIGHT { "heuristics/undercover/inferenceweight" }
	weight for inference score in fixing order

constexpr Param< bool >	LOCKSROUNDING { "heuristics/undercover/locksrounding" }
	shall LP values for integer vars be rounded according to locks?

constexpr Param< int >	MAXBACKTRACKS { "heuristics/undercover/maxbacktracks" }
	maximum number of backtracks in fix-and-propagate

constexpr Param< double >	MAXCOVERSIZECONSS { "heuristics/undercover/maxcoversizeconss" }
	maximum coversize (as ratio to the percentage of non-affected constraints)

constexpr Param< double >	MAXCOVERSIZEVARS { "heuristics/undercover/maxcoversizevars" }
	maximum coversize (as fraction of total number of variables)

constexpr Param< int >	MAXDEPTH { "heuristics/undercover/maxdepth" }
	maximal depth level to call primal heuristic <undercover> (-1: no limit)

constexpr Param< long long >	MAXNODES { "heuristics/undercover/maxnodes" }
	maximum number of nodes to regard in the subproblem

constexpr Param< int >	MAXRECOVERS { "heuristics/undercover/maxrecovers" }
	maximum number of recoverings

constexpr Param< int >	MAXREORDERS { "heuristics/undercover/maxreorders" }
	maximum number of reorderings of the fixing order

constexpr Param< int >	MINCOVEREDABS { "heuristics/undercover/mincoveredabs" }
	minimum number of nonlinear constraints in the original problem

constexpr Param< double >	MINCOVEREDREL { "heuristics/undercover/mincoveredrel" }
	minimum percentage of nonlinear constraints in the original problem

constexpr Param< double >	MINIMPROVE { "heuristics/undercover/minimprove" }
	factor by which the heuristic should at least improve the incumbent

constexpr Param< long long >	MINNODES { "heuristics/undercover/minnodes" }
	minimum number of nodes required to start the subproblem

constexpr Param< long long >	NODESOFS { "heuristics/undercover/nodesofs" }
	number of nodes added to the contingent of the total nodes

constexpr Param< double >	NODESQUOT { "heuristics/undercover/nodesquot" }
	contingent of sub problem nodes in relation to the number of nodes of the original problem

constexpr Param< bool >	ONLYCONVEXIFY { "heuristics/undercover/onlyconvexify" }
	should we only fix variables in order to obtain a convex problem?

constexpr Param< bool >	POSTNLP { "heuristics/undercover/postnlp" }
	should the NLP heuristic be called to polish a feasible solution?

constexpr Param< int >	PRIORITY { "heuristics/undercover/priority" }
	priority of heuristic <undercover>

constexpr Param< double >	RECOVERDIV { "heuristics/undercover/recoverdiv" }
	fraction of covering variables in the last cover which need to change their value when recovering

constexpr Param< bool >	REUSECOVER { "heuristics/undercover/reusecover" }
	shall the cover be reused if a conflict was added after an infeasible subproblem?

Detailed Description

Parameters with prefix heuristics/undercover.

Variable Documentation

◆ BEFORECUTS

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::BEFORECUTS { "heuristics/undercover/beforecuts" }

constexpr

should the heuristic be called at root node before cut separation?

Definition at line 4501 of file parameters.hpp.

◆ CONFLICTWEIGHT

Param<double> scippp::params::HEURISTICS::UNDERCOVER::CONFLICTWEIGHT { "heuristics/undercover/conflictweight" }

constexpr

weight for conflict score in fixing order

Definition at line 4469 of file parameters.hpp.

◆ COPYCUTS

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::COPYCUTS { "heuristics/undercover/copycuts" }

constexpr

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

Definition at line 4519 of file parameters.hpp.

◆ COVERAND

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::COVERAND { "heuristics/undercover/coverand" }

constexpr

should and constraints be covered (or just copied)?

Definition at line 4511 of file parameters.hpp.

◆ COVERBD

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::COVERBD { "heuristics/undercover/coverbd" }

constexpr

should bounddisjunction constraints be covered (or just copied)?

Definition at line 4513 of file parameters.hpp.

◆ COVERIND

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::COVERIND { "heuristics/undercover/coverind" }

constexpr

should indicator constraints be covered (or just copied)?

Definition at line 4515 of file parameters.hpp.

◆ COVERINGOBJ

Param<char> scippp::params::HEURISTICS::UNDERCOVER::COVERINGOBJ { "heuristics/undercover/coveringobj" }

constexpr

objective function of the covering problem (influenced nonlinear 'c'onstraints/'t'erms, 'd'omain size, 'l'ocks, 'm'in of up/down locks, 'u'nit penalties)

Definition at line 4496 of file parameters.hpp.

◆ COVERNL

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::COVERNL { "heuristics/undercover/covernl" }

constexpr

should nonlinear constraints be covered (or just copied)?

Definition at line 4517 of file parameters.hpp.

◆ CUTOFFWEIGHT

Param<double> scippp::params::HEURISTICS::UNDERCOVER::CUTOFFWEIGHT { "heuristics/undercover/cutoffweight" }

constexpr

weight for cutoff score in fixing order

Definition at line 4471 of file parameters.hpp.

◆ FIXINGALTS

Param<std::string> scippp::params::HEURISTICS::UNDERCOVER::FIXINGALTS { "heuristics/undercover/fixingalts" }

constexpr

prioritized sequence of fixing values used ('l'p relaxation, 'n'lp relaxation, 'i'ncumbent solution)

Definition at line 4461 of file parameters.hpp.

◆ FIXINGORDER

Param<char> scippp::params::HEURISTICS::UNDERCOVER::FIXINGORDER { "heuristics/undercover/fixingorder" }

constexpr

order in which variables should be fixed (increasing 'C'onflict score, decreasing 'c'onflict score, increasing 'V'ariable index, decreasing 'v'ariable index

Definition at line 4499 of file parameters.hpp.

◆ FIXINTFIRST

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::FIXINTFIRST { "heuristics/undercover/fixintfirst" }

constexpr

should integer variables in the cover be fixed first?

Definition at line 4503 of file parameters.hpp.

◆ FREQ

Param<int> scippp::params::HEURISTICS::UNDERCOVER::FREQ { "heuristics/undercover/freq" }

constexpr

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

Definition at line 4455 of file parameters.hpp.

◆ FREQOFS

Param<int> scippp::params::HEURISTICS::UNDERCOVER::FREQOFS { "heuristics/undercover/freqofs" }

constexpr

frequency offset for calling primal heuristic <undercover>

Definition at line 4457 of file parameters.hpp.

◆ INFERENCEWEIGHT

Param<double> scippp::params::HEURISTICS::UNDERCOVER::INFERENCEWEIGHT { "heuristics/undercover/inferenceweight" }

constexpr

weight for inference score in fixing order

Definition at line 4473 of file parameters.hpp.

◆ LOCKSROUNDING

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::LOCKSROUNDING { "heuristics/undercover/locksrounding" }

constexpr

shall LP values for integer vars be rounded according to locks?

Definition at line 4505 of file parameters.hpp.

◆ MAXBACKTRACKS

Param<int> scippp::params::HEURISTICS::UNDERCOVER::MAXBACKTRACKS { "heuristics/undercover/maxbacktracks" }

constexpr

maximum number of backtracks in fix-and-propagate

Definition at line 4489 of file parameters.hpp.

◆ MAXCOVERSIZECONSS

Param<double> scippp::params::HEURISTICS::UNDERCOVER::MAXCOVERSIZECONSS { "heuristics/undercover/maxcoversizeconss" }

constexpr

maximum coversize (as ratio to the percentage of non-affected constraints)

Definition at line 4477 of file parameters.hpp.

◆ MAXCOVERSIZEVARS

Param<double> scippp::params::HEURISTICS::UNDERCOVER::MAXCOVERSIZEVARS { "heuristics/undercover/maxcoversizevars" }

constexpr

maximum coversize (as fraction of total number of variables)

Definition at line 4475 of file parameters.hpp.

◆ MAXDEPTH

Param<int> scippp::params::HEURISTICS::UNDERCOVER::MAXDEPTH { "heuristics/undercover/maxdepth" }

constexpr

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

Definition at line 4459 of file parameters.hpp.

◆ MAXNODES

Param<long long> scippp::params::HEURISTICS::UNDERCOVER::MAXNODES { "heuristics/undercover/maxnodes" }

constexpr

maximum number of nodes to regard in the subproblem

Definition at line 4463 of file parameters.hpp.

◆ MAXRECOVERS

Param<int> scippp::params::HEURISTICS::UNDERCOVER::MAXRECOVERS { "heuristics/undercover/maxrecovers" }

constexpr

maximum number of recoverings

Definition at line 4491 of file parameters.hpp.

◆ MAXREORDERS

Param<int> scippp::params::HEURISTICS::UNDERCOVER::MAXREORDERS { "heuristics/undercover/maxreorders" }

constexpr

maximum number of reorderings of the fixing order

Definition at line 4493 of file parameters.hpp.

◆ MINCOVEREDABS

Param<int> scippp::params::HEURISTICS::UNDERCOVER::MINCOVEREDABS { "heuristics/undercover/mincoveredabs" }

constexpr

minimum number of nonlinear constraints in the original problem

Definition at line 4487 of file parameters.hpp.

◆ MINCOVEREDREL

Param<double> scippp::params::HEURISTICS::UNDERCOVER::MINCOVEREDREL { "heuristics/undercover/mincoveredrel" }

constexpr

minimum percentage of nonlinear constraints in the original problem

Definition at line 4479 of file parameters.hpp.

◆ MINIMPROVE

Param<double> scippp::params::HEURISTICS::UNDERCOVER::MINIMPROVE { "heuristics/undercover/minimprove" }

constexpr

factor by which the heuristic should at least improve the incumbent

Definition at line 4481 of file parameters.hpp.

◆ MINNODES

Param<long long> scippp::params::HEURISTICS::UNDERCOVER::MINNODES { "heuristics/undercover/minnodes" }

constexpr

minimum number of nodes required to start the subproblem

Definition at line 4465 of file parameters.hpp.

◆ NODESOFS

Param<long long> scippp::params::HEURISTICS::UNDERCOVER::NODESOFS { "heuristics/undercover/nodesofs" }

constexpr

number of nodes added to the contingent of the total nodes

Definition at line 4467 of file parameters.hpp.

◆ NODESQUOT

Param<double> scippp::params::HEURISTICS::UNDERCOVER::NODESQUOT { "heuristics/undercover/nodesquot" }

constexpr

contingent of sub problem nodes in relation to the number of nodes of the original problem

Definition at line 4483 of file parameters.hpp.

◆ ONLYCONVEXIFY

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::ONLYCONVEXIFY { "heuristics/undercover/onlyconvexify" }

constexpr

should we only fix variables in order to obtain a convex problem?

Definition at line 4507 of file parameters.hpp.

◆ POSTNLP

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::POSTNLP { "heuristics/undercover/postnlp" }

constexpr

should the NLP heuristic be called to polish a feasible solution?

Definition at line 4509 of file parameters.hpp.

◆ PRIORITY

Param<int> scippp::params::HEURISTICS::UNDERCOVER::PRIORITY { "heuristics/undercover/priority" }

constexpr

priority of heuristic <undercover>

Definition at line 4453 of file parameters.hpp.

◆ RECOVERDIV

Param<double> scippp::params::HEURISTICS::UNDERCOVER::RECOVERDIV { "heuristics/undercover/recoverdiv" }

constexpr

fraction of covering variables in the last cover which need to change their value when recovering

Definition at line 4485 of file parameters.hpp.

◆ REUSECOVER

Param<bool> scippp::params::HEURISTICS::UNDERCOVER::REUSECOVER { "heuristics/undercover/reusecover" }

constexpr

shall the cover be reused if a conflict was added after an infeasible subproblem?

Definition at line 4521 of file parameters.hpp.

SCIP++ refs/heads/main

Variables

Detailed Description

Variable Documentation

◆ BEFORECUTS

◆ CONFLICTWEIGHT

◆ COPYCUTS

◆ COVERAND

◆ COVERBD

◆ COVERIND

◆ COVERINGOBJ

◆ COVERNL

◆ CUTOFFWEIGHT

◆ FIXINGALTS

◆ FIXINGORDER

◆ FIXINTFIRST

◆ FREQ

◆ FREQOFS

◆ INFERENCEWEIGHT

◆ LOCKSROUNDING

◆ MAXBACKTRACKS

◆ MAXCOVERSIZECONSS

◆ MAXCOVERSIZEVARS

◆ MAXDEPTH

◆ MAXNODES

◆ MAXRECOVERS

◆ MAXREORDERS

◆ MINCOVEREDABS

◆ MINCOVEREDREL

◆ MINIMPROVE

◆ MINNODES

◆ NODESOFS

◆ NODESQUOT

◆ ONLYCONVEXIFY

◆ POSTNLP

◆ PRIORITY

◆ RECOVERDIV

◆ REUSECOVER