Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
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.
Zhengxin Zhang, Ziv Goldfeld, et al.
Foundations of Computational Mathematics
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics