Abstract
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.
Similar content being viewed by others
References
D. Coppersmith and J. Lee, “Indivisibility and divisibility polytopes,” Novel Approaches to Hard Discrete Optimization. Fields Institute Communications, American Mathematical Society, Providence, Rhode Island, 2003, pp. 71–95.
G. Cornuéjols, Combinatorial Optimization. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM), 2001. Packing and covering.
M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 2nd edn., Berlin: Springer-Verlag, 1993.
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization.Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: John Wiley & Sons Inc., 1988. A Wiley-Interscience Publication.
G.M. Ziegler, Lectures on Polytopes. Vol. 152 of Graduate Texts in Mathematics, New York: Springer-Verlag, 1995. Revised edn., 1998.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lee, J. Cropped Cubes. Journal of Combinatorial Optimization 7, 169–178 (2003). https://doi.org/10.1023/A:1024475030446
Issue Date:
DOI: https://doi.org/10.1023/A:1024475030446