Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
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.
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
John S. Lew
Mathematical Biosciences
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002