Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
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.
Ronen Feldman, Martin Charles Golumbic
Ann. Math. Artif. Intell.
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Shu Tezuka
WSC 1991
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007