On Ternary Problems, Mathematical Programming
We consider ternary matrices, i.e., integer matrices having all entries 0, 1 or 2. Three associated problems the group problem, covering, and packing are studied. General classes of vertices and facets are discussed in each case. Certain lifting procedures are also described. For all three problems techniques used are natural extensions of those used in the binary case.
Chopra, Sunil. 1989. On Ternary Problems. Mathematical Programming. 45(1-3): 35-47.