Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
We study certain generalized covering polytopes that we call "cropped cubes". These polytopes generalize the clipped cubes which Coppersmith and Lee used to study the nondyadic indivisibility polytopes. Our main results are (i) a totally dual integral inequality description of the cropped cubes, and (ii) an efficient separation procedure.
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989