Reena Elangovan, Shubham Jain, et al.
ACM TODAES
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.
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008