A.5.
Computer Program
Notation
201
Variable
Routine (s) Where Used
TOTPRI
DAMBLD, PRINTEX
YO
BAKTRAK, BOUND,
DAMBLD
Significance
= .TRUE. Print original
network configuration
= .FALSE. Print final
network configuration
= .TRUE. Signifies
BOUND is called from
DAMBLD
= .FALSE. Signifies
BOUND is called from
BAKTRAK
A.5.3. Counting
Variables
Variable
Routine (s) Where Used
ISPY
BAKTRAK, NETFLO
IZ
BAKTRAK, DAMBLD
ΚΟΡΕ
BAKTRAK
BAKTRAK, BOUND
TEX
BAKTRAK
TOT
BAKTRAK, BOUND,
DAMBLD
TU
BAKTRAK
Significance
Counts nonfeasible solutions
Identification number of
the feasible solutions
with return higher than
the first feasible solution
in a monotonically
increasing order
Identifies the number of
feasible solutions, whose
bound was higher than
the best current feasible
solution but whose net
return was lower than the
best current feasible
solution
Steps forward in time
from a node obtained
from a backtrack
Used for backtracking
Equals Τ - 1
Used for going through the
1ST matrix when returning parts to their
"former potency"