Using integer programming in finding t-designs
A t-design is a combinatorial structure consisting of a collection of blocks over a set of points satisfying certain properties. The existence of t-designs given a set of parameters can be reduced to finding nonnegative integer solutions to a given integer matrix equation. The matrix in this equat...
Main Author: | Chung, Kelvin |
---|---|
Language: | en |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/6657 |
Similar Items
-
Using integer programming in finding t-designs
by: Chung, Kelvin
Published: (2012) -
On the number of mutually disjoint cyclic designs
by: Mojgan Emami, et al.
Published: (2014-03-01) -
New approaches to integer programming
by: Chandrasekaran, Karthekeyan
Published: (2012) -
FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.
by: SINGHAL, JAYA ASTHANA.
Published: (1982) -
Heuristic Methods of Integer Programming and Its Applications in Economics
by: Dominika Crnjac Milić, et al.
Published: (2010-12-01)