#
# Configuration file for abacus
#

#
# ENUMERATION STRATEGY
# 
#   valid settings: BestFirst    (best first search)
#                   BreadthFirst (breadth first search)
#                   DepthFirst   (depth first search)
#                   DiveAndBest  (first depth, later best first search)
#
EnumerationStrategy		BestFirst
#EnumerationStrategy		DiveAndBest
#EnumerationStrategy		DepthFirst
#EnumerationStrategy		BreadthFirst

#
# BRANCHING STRATEGY
#   valid settings: CloseHalf (select variable with fraction closest to 0.5)
#                   CloseHalfExpensive (select variable close to 0.5 having
#                   high absolute objective function coefficient)
#
#
BranchingStrategy		CloseHalfExpensive

#
# TESTING BRANCHING VARIABLES
#
#   this number indicates how many candidates for branching variables
#   should be tested according to the BranchingStrategy. If this
#   number is 1, a single variable is determined (if possible) that
#   is the branching variable. If this number is greater than 1
#   each candidate is tested and the best branching variable is
#   selected, i.e., for each candidate the two linear programs of
#   potential sons are solved. The variable for which the minimal
#   change of the two objective function values is maximal is selected
#   as branching variable.
#
#   valid settings: positive integer number
#
NBranchingVariableCandidates	1

#
# SOLUTION GUARANTEE
#
#   valid settings: any nonnegative floating point number
#                   0.0 indicates solution to optimality
#
Guarantee			0.0

#
# MAXIMAL LEVEL IN ENUMERATION TREE
#
#   valid settings: any positive integer
#                   1 = then no branch and bound is performed, pure cutting
#                       plane algorithm
#
MaxLevel			999999

#
# MAXIMAL CPU TIME
#
#   valid settings: string in the format hours:minutes:seconds
#                   the string converted to seconds must be less than MAX_INT
#
MaxCpuTime		       0:30:00
#MaxCpuTime			0:00:01

#
# MAXIMAL CLOCK OF THE WALL TIME
#
#   valid settings: string in the format hours:minutes:seconds
#                   the string converted to seconds must be less than MAX_INT
#
MaxCowTime			2:00:00

# 
# INTEGRALITY OF OBJECTIVE FUNCTION VALUES OF FEASIBLE SOLUTIONS
# 
#   valid settings: true/false
#
ObjInteger			true	

#
# NUMBER OF LPS CONSIDERED IN TAILING OFF ANALYSIS
#
#  valid settings: positive integer    => tailing off control
#                  nonpositive integer => no tailing off control 
#
TailOffNLps			-1	

# 
# MINIMAL IMPROVEMENT IN TAILING OFF ANALYSIS IN PERCENT
#
#   valid settings: any nonnegative floating point number
#
TailOffPercent			0.009

#
# THRESHOLD FOR DELAYED BRANCHING
# 
#   valid settings: any nonnegative integer
#                   0 = immediate branching after first subproblem optimization
#
DelayedBranchingThreshold	1

#
# THE MINIMAL NUMBER OF ROUNDS A SUBPROBLEM STAYS DORMANT
#
# valid settings: a positive integer
#
MinDormantRounds		1

#
# OUTPUT LEVEL
#
# valid settings: Silent
#                 Statistics
#                 Subproblem
#                 LinearProgram
#                 Full
#
OutputLevel			Silent

#
# SHOULD THE OUTPUT BE ALSO WRITTEN TO A LOGFILE
#
# valid settings: see OutputLevel
#
LogLevel			Silent

#
# PRIMAL BOUND INITIALIZATION MODE
#
#   valid settings: None
#                   Optimum
#                   OptimumOne
#
PrimalBoundInitMode		None

#
# PRICING FREQUENCY
#
#   valid settings: any nonnegative integer
#
PricingFrequency		0

#  
# SKIP FACTOR FOR CUTTING
#
#   valid settings: any nonnegative integer
#
SkipFactor			1

#
# SKIPPING MODE
#   valid settings: SkipByNode  => skipping according to number of nodes
#                   SkipByLevel => skipping according to level in tree
#
SkippingMode			SkipByNode

#
# SHOULD VARIABLES BY FIXED AND SET BY REDUCED COST
#
FixSetByRedCost			true

#
# SHOULD THE LP BE OUTPUT EVERY ITERATION
#
PrintLP				false	


#
# THE MAXIMAL NUMBER OF CONSTRAINTS ADDED PER ITERATION
#
MaxConAdd			10000

#
# THE MAXIMAL NUMBER OF CONSTRAINTS BUFFERED PER ITERATION
#
MaxConBuffered			100000

#
# THE MAXIMAL NUMBER OF VARIABLES ADDED PER ITERATION
#
MaxVarAdd			100000

#
# THE MAXIMAL NUMBER OF VARIABLES BUFFERED PER ITERATION
#
MaxVarBuffered			1000000

#
# THE MAXIMAL NUMBER OF ITERATIONS IN THE CUTTING PLANE PHASE
#   -1 = unlimited
#
MaxIterations			-1

#
# ELIMINATE FIXED AND SET VARIABLES FROM THE LP
#
EliminateFixedSet		false

#
# REOPTIMIZE NEW ROOT OF REMAINING BRANCH AND CUT TREE
#
NewRootReOptimize		false

#
# NAME OF THE FILE STORING THE OPTIMUM SOLUTIONS
#
# OptimumFileName 
#
#   this is only an optional parameter

#
# SHOW THE AVERAGE DISTANCE OF THE CUTS PER ITERATION
#
ShowAverageCutDistance		false

#
# CONSTRAINT ELIMININATION
#
#
# valid settings: None
#                 NonBinding
#                 Basic
#
ConstraintEliminationMode	NonBinding 

#
# TOLERANCE FOR CONSTRAINT ELIMINATION
# 
# This tolerance is only of relevance for the constraint elimination
# mode NonBinding.
#
ConElimEps			0.001

#
# THE AGE FOR CONSTRAINT ELIMINATION
#
# 
# The number of iterations an elimination criterion for a constraint
# must be satisfied until the constraint is eliminated from the active
# constraints.
#
# valid settings: a nonnegative integer number

ConElimAge                     1 

#
# VARIABLE ELIMINATION MODE
#
# valide settings: None
#                  ReducedCost
#
VariableEliminationMode		ReducedCost

#
# TOLERANCE FOR VARIABLE ELIMINATION
#
VarElimEps			0.001

#
# THE AGE FOR VARIABLE ELIMINATION
#
# 
# The number of iterations an elimination criterion for a variable
# must be satisfied until the variable is eliminated from the active
# variables.
#
# valid settings: a nonnegative integer number

VarElimAge                      1

#
# GENERATION OF A LOG-FILE OF THE ENUMERATION TREE
#
# valid settings: None
#                 File
#                 Pipe

VbcLog				None

#
# THE DEFAULT LP-SOLVER
#
# valid settings: Cplex
#                 Soplex
#                 Xpress

DefaultLpSolver                  Cplex


#
# THE DEFAULT PRIMAL PRICING STRATEGY FOR CPLEX
#
# valid settings (see also Cplex manual):
#
#     CPX_PPRIIND_PARTIAL
#     CPX_PPRIIND_AUTO
#     CPX_PPRIIND_DEVEX
#     CPX_PPRIIND_STEEP
#     CPX_PPRIIND_STEEPQSTART
#     CPX_PPRIIND_FULL

CplexPrimalPricing		CPX_PPRIIND_AUTO

#
# THE DEFAULT DUAL PRICING STRATEGY FOR CPLEX
#
#
# valid settings (see also Cplex manual):
#
#     CPX_DPRIIND_AUTO
#     CPX_DPRIIND_FULL
#     CPX_DPRIIND_STEEP
#     CPX_DPRIIND_FULLSTEEP
#     CPX_DPRIIND_STEEPQSTART

CplexDualPricing		CPX_DPRIIND_STEEP

#
# THE OUTOUT LEVEL OF CPLEX
#
# valid settings:
#
#   0 no output
#   1 output every refactorization
#   2 output every iteration

CplexOutputLevel		0

#
# HOLD CPLEX ENVIRONMENT
#
# If this parameter is true, then the Cplex environment
# is held open during the branch-and-cut optimization.
# This reserves a Cplex license for the complete time of
# optimization.
#
CplexHoldEnvironment            true

#
# THE BASIS REPRESENTATION OF SOPLEX
#
# Warning: The Soplex representation Column is not stable in Soplex 1.0
#
# valid settings: Row
#                 Column

SoPlexRepresentation            Row

#
# THE DEFAULT PRICING STRATEGY OF XPRESS
#
# valid settings (see control variable N_IPHSF in Xpress manual):
#
#      0 if the pricing is to be decided automatically
#      1 if DEVEX pricing is to be used
#     -1 if partial pricing is to be used

XpressPricing			0

#
# PRESOLVE FLAG OF XPRESS
#
# valid settings: true       (presolving is turned on)
#                 false      (presolving is turned off)

XpressPresolve			true

#
# THE OUTOUT FLAG OF XPRESS
#
# valid settings: true       (output is turned on)
#                 false      (output is turned off)

XpressOutput			false

