Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Here we describe computationally efficient procedures for tightening cover induced inequalities by using 0-1 knapsack constraints and, if available, cliques whose variables are included in the cover. An interesting application is the case where the cover is implied by the knapsack constraint. The tightening is achieved by increasing the coefficients of the cover inequality. The new constraint is 0-1 equivalent to and LP tighter than the original one. The computational complexity of the procedures is O(n log n), where n is the number of variables in the cover. © 1992.
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
David A. Selby
IBM J. Res. Dev
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering