Parameters with prefix heuristics/padm. More...
Variables | |
constexpr Param< int > | ADMITERATIONS { "heuristics/padm/admiterations" } |
maximal number of ADM iterations in each penalty loop | |
constexpr Param< bool > | ASSIGNLINKING { "heuristics/padm/assignlinking" } |
should linking constraints be assigned? | |
constexpr Param< int > | FREQ { "heuristics/padm/freq" } |
frequency for calling primal heuristic <padm> (-1: never, 0: only at depth freqofs) | |
constexpr Param< int > | FREQOFS { "heuristics/padm/freqofs" } |
frequency offset for calling primal heuristic <padm> | |
constexpr Param< double > | GAP { "heuristics/padm/gap" } |
mipgap at start | |
constexpr Param< int > | MAXDEPTH { "heuristics/padm/maxdepth" } |
maximal depth level to call primal heuristic <padm> (-1: no limit) | |
constexpr Param< long long > | MAXNODES { "heuristics/padm/maxnodes" } |
maximum number of nodes to regard in all subproblems | |
constexpr Param< long long > | MINNODES { "heuristics/padm/minnodes" } |
minimum number of nodes to regard in one subproblem | |
constexpr Param< double > | NODEFAC { "heuristics/padm/nodefac" } |
factor to control nodelimits of subproblems | |
constexpr Param< bool > | ORIGINAL { "heuristics/padm/original" } |
should the original problem be used? This is only for testing and not recommended! | |
constexpr Param< int > | PENALTYITERATIONS { "heuristics/padm/penaltyiterations" } |
maximal number of penalty iterations | |
constexpr Param< int > | PRIORITY { "heuristics/padm/priority" } |
priority of heuristic <padm> | |
constexpr Param< bool > | REOPTIMIZE { "heuristics/padm/reoptimize" } |
should the problem get reoptimized with the original objective function? | |
constexpr Param< bool > | SCALING { "heuristics/padm/scaling" } |
enable sigmoid rescaling of penalty parameters | |
constexpr Param< int > | TIMING { "heuristics/padm/timing" } |
should the heuristic run before or after the processing of the node? (0: before, 1: after, 2: both) | |
Parameters with prefix heuristics/padm.
|
constexpr |
maximal number of ADM iterations in each penalty loop
Definition at line 3570 of file parameters.hpp.
|
constexpr |
should linking constraints be assigned?
Definition at line 3580 of file parameters.hpp.
|
constexpr |
frequency for calling primal heuristic <padm> (-1: never, 0: only at depth freqofs)
Definition at line 3558 of file parameters.hpp.
|
constexpr |
frequency offset for calling primal heuristic <padm>
Definition at line 3560 of file parameters.hpp.
|
constexpr |
mipgap at start
Definition at line 3574 of file parameters.hpp.
|
constexpr |
maximal depth level to call primal heuristic <padm> (-1: no limit)
Definition at line 3562 of file parameters.hpp.
|
constexpr |
maximum number of nodes to regard in all subproblems
Definition at line 3564 of file parameters.hpp.
|
constexpr |
minimum number of nodes to regard in one subproblem
Definition at line 3566 of file parameters.hpp.
|
constexpr |
factor to control nodelimits of subproblems
Definition at line 3568 of file parameters.hpp.
|
constexpr |
should the original problem be used? This is only for testing and not recommended!
Definition at line 3582 of file parameters.hpp.
|
constexpr |
maximal number of penalty iterations
Definition at line 3572 of file parameters.hpp.
|
constexpr |
priority of heuristic <padm>
Definition at line 3556 of file parameters.hpp.
|
constexpr |
should the problem get reoptimized with the original objective function?
Definition at line 3576 of file parameters.hpp.
|
constexpr |
enable sigmoid rescaling of penalty parameters
Definition at line 3578 of file parameters.hpp.
|
constexpr |
should the heuristic run before or after the processing of the node? (0: before, 1: after, 2: both)
Definition at line 3584 of file parameters.hpp.