Cropped Cubes

Jon Lee ()
Additional contact information
Jon Lee: IBM T.J. Watson Research Center

Journal of Combinatorial Optimization, 2003, vol. 7, issue 2, No 4, 169-178

Abstract: 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.

Keywords: linear program; integer program; polytope; totally dual integral; ideal matrix; generalized set covering; clipped cube; cropped cube; balanced matrix (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1024475030446 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:7:y:2003:i:2:d:10.1023_a:1024475030446

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1024475030446

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().