batch

#!/usr/bin/env bash
#
# usage: batch < exe file > < par file > < solver > < log file >
#        < exe file > = path of the executable, default BinaryKnapsackBlock_test
#        < par file > = BlockSolverConfig file, default BSPar.txt
#        < solver > = unused
#        < log file > = name of log file, default no log
#
# Cross-check on PURE-BINARY instances (nI = 1): every solver /
# formulation that must give the same integer optimum is attached at once (see
# BSPar.txt) and SolveAll() checks they all agree -- the exact :MILPSolver,
# the full-table / parallel / core DP, and the BranchAndXSolver in each of its
# exploration modes -- while the greedy relaxation must bracket that optimum.
# This replaces the former one-batch-per-formulation correctness tests.

# run from the test directory so BinaryKnapsackBlock_test reads its config files
here="$(cd "$(dirname "$0")" && pwd)"
cd "$here/.." || exit 1

# shared CLI/run helpers - - - - - - - - - - - - - - - - - - - - - - - - - -
source "$here/../../batch_common.sh"
source "$here/bkb_battery.sh"

DEFAULT_EXE=./BinaryKnapsackBlock_test
DEFAULT_PAR=BSPar.txt
# the accuracy each Solver is held to is the dblRelAcc of its ComputeConfig,
# except for the greedy relaxation, the fourth one in BSPar.txt, which is
# held instead to the quality of the bounds it produces on these instances
# (measured worst case over the whole battery: 5.4e-01)
EPS="${EPS:-,,,6e-1}"
parse_batch_args "$@"

# fixed harness parameters - - - - - - - - - - - - - - - - - - - - - - - - -
# (the sweep is leaner than the single-formulation batches: every instance is
# solved by all the ~11 attached solvers)
seed=264
wchg=63
n_repeat=10
nI=1

# sweep- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

sweep N "50 100 200" delta "0.01 0.1 0.6" nW "0 0.2" nP "0 0.2" \
      nM "0 0.2" -- bkb_run

# the end - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -