Nimrod Megiddo
Journal of Symbolic Computation
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.
Nimrod Megiddo
Journal of Symbolic Computation
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Jianke Yang, Robin Walters, et al.
ICML 2023