Title: Lattice Polyhedra II: Generalization, Constructions and Examples
Abstract: This chapter provides an overview of lattice polyhedra II. Lattice polyhedra are a certain class of polyhedra that not only have all vertices integral but also have the property that, when objective functions are integral, dual linear programs have integer optimal solutions whenever they have optimum solutions. Accordingly, they are suitable for proving combinatorial extremal theorems. The chapter presents some methods for constructing polyhedra from some simple notions and explores the question of whether each such polyhedron arises this way. Sub- and supermodular consecutive functions are examined in the chapter.
Publication Year: 1982
Publication Date: 1982-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 20
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot