Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
The knapsack problem with special ordered sets and arbitrarily signed coefficients is shown to be equivalent to a standard problem of the same type but having all coefficients positive. Two propositions are proven which define an algorithm for the linear programming relaxation of the standard problem that is a natural generalization of the Dantzig solution to the problem without special ordered sets/ Several properties of the corvex hull of the associated zero-one polytope are derived. © 1981.
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991