Polyhedral Methods in Design Theory

Lucia Moura ()
Additional contact information
Lucia Moura: University of Toronto, Department of Computer Science

Chapter Chapter 9 in Computational and Constructive Design Theory, 1996, pp 227-254 from Springer

Abstract: Abstract This chapter is devoted to the relation between polyhedral theory and combinatorial designs. The polyhedral aspects of constructing packings, coverings and t-designs are emphasized. Classical results and algorithms in polyhedral theory are summarized, integer programming formulation of design construction problems are presented, and polyhedra associated to these formulations and related algorithms are discussed.

Keywords: Valid Inequality; Integer Programming Problem; Integer Programming Formulation; Incidence Vector; Clique Inequality (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:sprchp:978-1-4757-2497-4_9

Ordering information: This item can be ordered from
http://www.springer.com/9781475724974

DOI: 10.1007/978-1-4757-2497-4_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().