Parameters¶

Control solver behavior with setParam. Works on all model classes (Model, PathModel, McfModel).

model.setParam("parameterName", value)

Parameter Table¶

Parameter	Description	Type	Default
Branch_NumStrongBranchCandidates	Number of strong branch candidates	`int`	128
Branch_StrongBranchParallel	Do strong branching in parallel	`bool`	`True`
LicenseFilepath	Path to license file	`str`	`None`
LogFilepath	Path to log file	`str`	`logs/flowty.log`
LogLevel	Console logging (trace=0, debug=1, info=2, warn=3, error=4, critical=5, off=6)	`int`	2
LogLevelFile	File logging (trace=0, debug=1, info=2, warn=3, error=4, critical=5, off=6)	`int`	2
Lp_MaxIterationsRecover	Iterations to recover from unstable LP	`int`	10
Master_Cut_LimitIteration	Max cuts per iteration	`int`	10
Master_Cut_LimitTotal	Max cuts total	`int`	1000
Master_Cut_MinViolation	Minimum cut violation (absolute)	`float`	0.05
Master_Cut_UseSubsetRow	Use subset row inequalities (valid for set partition on vertices)	`bool`	`False`
Master_DumpGraphFilename	File to dump graphs to	`str`	`None`
Master_DumpLpFilename	File to dump LPs to	`str`	`None`
Master_MaxColIterations	Max column generation iterations	`int`	max
Master_MinColInactivity	Iterations before removing inactive columns	`int`	max
Master_MinRowInactivity	Iterations before removing inactive rows	`int`	5
Master_NgSet_MaxLargeCycleSize	Max size for detecting large cycles	`int`	100
Master_NgSet_MaxNeighbours	Max neighbours in NG-sets	`int`	24
Master_NgSet_MaxSmallCycleSize	Max size for detecting small cycles	`int`	5
Master_PricerFrequency	Frequency of solving pricing problem	`int`	1
Master_PrintFreqency	Master iteration print frequency	`int`	1
Master_PrintOnlyRoot	Print master details only in root node	`bool`	`True`
Master_PrintTimingDetails	Print timing details	`bool`	`False`
Master_SepFrequency	Cut separation frequency	`int`	1000
Master_SepLazyFrequency	Lazy cut separation frequency	`int`	1
Master_SepNgSetFrequency	NG-set separation frequency	`int`	max
Master_UnusedThreshold	Threshold for tracking inactive rows	`float`	0.9
MIPGap	Relative MIP gap (percentage)	`float`	1e-4
MIPGapAbs	Absolute MIP gap	`float`	1e-10
MIPHeuristicEmphasis	MIP heuristic effort [0.0-1.0]	`float`	0.05
NumThreads	Threads for multi-processing	`int`	available
Pricer_Algorithm	Pricing DP algorithm (0=auto, 1=pull, 2=push)	`int`	0
Pricer_HeuristicHighFilter	Min in/out degree for high heuristic (0=disable)	`int`	12
Pricer_HeuristicLowFilter	Min in/out degree for low heuristic (0=disable)	`int`	7
Pricer_HeuristicMediumFilter	Min in/out degree for medium heuristic (0=disable)	`int`	0
Pricer_MaxNumCols	Max columns added per iteration	`int`	400
Pricer_MaxNumPricings	Max pricing problems solved in parallel	`int`	400
Pricer_MaxNumVars	Max variables added per pricing iteration	`int`	400
Pricer_MultiThreading	Allow multi-threading in pricing	`bool`	`True`
Pricer_UseSparseStorage	Use sparse storage in shortest path	`bool`	`False`
PrimalHeu_DiveFrequency	Branch nodes between dives	`int`	11
PrimalHeu_DiveMaxColIterations	Max column iterations when diving	`int`	max
PrimalHeu_DiveMaxIterations	Max dive heuristic iterations	`int`	100
PrimalHeu_DivePrintFreqency	Dive heuristic print frequency	`int`	10
PrimalHeu_DiveStrongBranchParallel	Parallel strong branch when diving	`bool`	`True`
PrimalHeu_NumStrongBranchCandidates	Max strong branch candidates (heuristic)	`int`	32
PrimalHeu_RestrictedMipFrequency	Restricted MIP heuristic frequency	`int`	101
PrimalHeu_RestrictedMipMaxIterations	Max restricted MIP iterations	`int`	500
TimeLimit	Solver time limit in seconds	`int`	max
TreeManager_MaxBranchNodes	Max branch nodes (0=unlimited)	`int`	0
TreeManager_PrintFreqency	Branch tree print frequency	`int`	1