An unconstrained dual for linear programming and its solution by piecewise linear optimization
Gunn, Eldon A.
Util. Math. 20, 5-19 (1981).
A one-factorisation of a Cartesian product
Wallis, W. D.
Util. Math. 20, 21-25 (1981).
Information measures and cohomology
Davidson, Kenneth R.; Ng, C. T.
Util. Math. 20, 27-34 (1981).
On the transition probability function for cell-structure models
Moore, Marc
Util. Math. 20, 35-51 (1981).
Pre-orders, closure operators and grammar forms
von Braunmühl, Burchard; Hotzel, E.; Wood, D.
Util. Math. 20, 53-81 (1981).
Eigengraphs: Constructing strongly regular graphs with block designs
Thompson, Donald M.
Util. Math. 20, 83-115 (1981).
Minimum number of edges in P3−connected graphs
Enomoto, Hikoe; Usami, Yoko
Util. Math. 20, 117-141 (1981).
Latin queen squares
Herzberg, Agnes M.; Garner, Cyril W. L.
Util. Math. 20, 143-154 (1981).
A note on one-factorizations
Hartman, A.; Stinson, D. R.
Util. Math. 20, 155-162 (1981).
A treatment of corner singularities in potential theory
Meek, D. S.; Mohsen, Adel A.
Util. Math. 20, 163-174 (1981).
Some algorithmic results on (2,3,3,V) designs and (2,4,4,V) designs
Bate, J. A.; Stanton, R. G.
Util. Math. 20, 195-220 (1981).
Pseudo-rigid bodies
Cohen, H.
Util. Math. 20, 221-247 (1981).
An enumeration of S-cyclic SQS(26)
Grannell, M. J.; Griggs, T. S.
Util. Math. 20, 249-259 (1981).
Discrete orthogonal systems corresponding to Dirichlet distribution
Rahman, Mizan
Util. Math. 20, 261-272 (1981).
Asymptotic enumeration of generalized Latin rectangles
Nechvatal, James R.
Util. Math. 20, 273-292 (1981).
On the connectivity of regular random digraphs
Palmer, V. Dewayne
Util. Math. 20, 293-299 (1981).
