@techreport{TD:100250,
	att_abstract={{We present a biased random-key genetic algorithm (BRKGA) for finding small
covers of computationally difficult set covering problems that arise in
computing the 1-width of incidence matrices of Steiner triple systems.
Using a parallel implementation of the BRKGA, we compute improved covers
for the two largest instances in a standard set of test problems used
to evaluate solution procedures for this problem.  The new covers for
instances A405 and A729 have sizes 335 and 617, respectively.  On all
other smaller instances our algorithm consistently produces covers of
optimal size.
}},
	att_authors={mr5626},
	att_categories={C_CCF.1, C_CCF.2, C_CCF.7, C_CCF.8},
	att_copyright={{Springer}},
	att_copyright_notice={{The definitive version was published in Optimization Letters {{, 2011-12-31}}{{, 10.1007/s11590-011-0285-3}}}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={},
	att_techdoc={true},
	att_techdoc_key={TD:100250},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:100250_DS1_2010-10-20T18:35:53.389Z.pdf},
	author={Mauricio Resende and Rodrigo F. Toso and José F. Gonçalves and Ricardo M.A. Silva},
	institution={{Optimization Letters}},
	month={December},
	title={{A biased random-key genetic algorithm for the Steiner triple covering problem}},
	year=2011,
}