Volume 89, Number 1-3, December 1998
: Disjunctive Programming: Properties of the Convex Hull of Feasible Points.
: Fringe Thickness and Maximum Path Length of Binary Trees.
: Linking Discrete Orthogonality with Dilation and Translation for Incomplete Sigma-pi Neural Networks of Hopfield-type.
: A Fast Algorithm for Strongly Correlated Knapsack Problems.
: A Note on Spanning Local Tournaments in Locally Semicomplete Digraphs.
: How Good Are Branching Rules in DPLL?