Browsing by Subject "branch-and-cut"
Now showing items 1-1 of 1
-
(Texas A&M University, 2004-09-30)We consider combinatorial t-design problems as discrete optimization problems. Our motivation is that only a few studies have been done on the use of exact optimization techniques in designs, and that classical methods in ...