{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:34:23Z","timestamp":1764783263069},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,2,6]],"date-time":"2011-02-06T00:00:00Z","timestamp":1296950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11590-011-0285-3","type":"journal-article","created":{"date-parts":[[2011,2,5]],"date-time":"2011-02-05T04:42:01Z","timestamp":1296880921000},"page":"605-619","source":"Crossref","is-referenced-by-count":25,"title":["A biased random-key genetic algorithm for the Steiner triple covering problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Mauricio G. C.","family":"Resende","sequence":"first","affiliation":[]},{"given":"Rodrigo F.","family":"Toso","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Fernando","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"given":"Ricardo M. A.","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,6]]},"reference":[{"key":"285_CR1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s11590-006-0021-6","volume":"1","author":"R.M. Aiex","year":"2007","unstructured":"Aiex R.M., Resende M.G.C., Ribeiro C.C.: TTTPLOTS: a perl program to create time-to-target plots. Optim. Lett. 1, 201\u2013212 (2007)","journal-title":"Optim. Lett."},{"key":"285_CR2","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01588309","volume":"18","author":"D. Avis","year":"1980","unstructured":"Avis D.: A note on some computationally difficult set covering problems. Math. Program. 18, 138\u2013145 (1980)","journal-title":"Math. Program."},{"key":"285_CR3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J.C. Bean","year":"1994","unstructured":"Bean J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"285_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo T.A., Resende M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"key":"285_CR5","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","volume":"2","author":"D.R. Fulkerson","year":"1974","unstructured":"Fulkerson D.R., Nemhauser G.L., Trotter L.E. Jr.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Math. Programm. Study 2, 72\u201381 (1974)","journal-title":"Math. Programm. Study"},{"key":"285_CR6","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and intractability. A guide to the theory of NP-completeness. WH Freeman and Company, San Francisco (1979)"},{"key":"285_CR7","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics (2010a). doi: 10.1007\/s10732-010-9143-1","DOI":"10.1007\/s10732-010-9143-1"},{"key":"285_CR8","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J. Combin. Optim. (2010b). doi: 10.1007\/s10878-009-9282-1","DOI":"10.1007\/s10878-009-9282-1"},{"key":"285_CR9","volume-title":"Combinatorial theory","author":"M. Hall","year":"1967","unstructured":"Hall M.: Combinatorial theory. Blaisdell Company, Minneapolis (1967)"},{"key":"285_CR10","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"285_CR11","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/BF01582907","volume":"52","author":"N.K. Karmarkar","year":"1991","unstructured":"Karmarkar N.K., Resende M.G.C., Ramakrishnan K.G.: An interior point algorithm to solve computationally difficult set covering problems. Math. Programm. 52, 597\u2013618 (1991)","journal-title":"Math. Programm."},{"key":"285_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(95)00034-H","volume":"18","author":"C. Mannino","year":"1995","unstructured":"Mannino C., Sassano A.: Solving hard set covering problems. Oper. Res. Lett. 18, 1\u20135 (1995)","journal-title":"Oper. Res. Lett."},{"key":"285_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M. Matsumoto","year":"1998","unstructured":"Matsumoto M., Nishimura T.: Mersenne Twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8, 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"285_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0020-0190(97)80440-1","volume":"65","author":"M.A. Odijk","year":"1998","unstructured":"Odijk M.A., van Maaren H.: Improved solutions to the Steiner triple covering problem. Inf. Process. Lett. 65, 67\u201369 (1998)","journal-title":"Inf. Process. Lett."},{"key":"285_CR15","unstructured":"OpenMP. Last visited on 19 October (2010). http:\/\/openmp.org"},{"key":"285_CR16","doi-asserted-by":"crossref","unstructured":"\u00d6sterg\u00e5rd, P., Vaskelainen, V.: Russian doll search for the Steiner triple covering problem. Optimization Letters, pp. 1\u20138 (2010) doi: 10.1007\/s11590-010-0225-7","DOI":"10.1007\/s11590-010-0225-7"},{"key":"285_CR17","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Solving large Steiner triple covering problems. Technical Report 1663, Computer Sciences Department, University of Wisconsin, Madison (2009)"},{"key":"285_CR18","doi-asserted-by":"crossref","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Solving Steiner triple covering problems. Optima 83 (2010)","DOI":"10.1016\/j.orl.2011.02.001"},{"key":"285_CR19","volume-title":"BRKGA framework: A C++ framework for implementing biased random-key genetic algorithms","author":"M.G.C. Resende","year":"2010","unstructured":"Resende M.G.C., Toso R.F.: BRKGA framework: A C++ framework for implementing biased random-key genetic algorithms. Technical report, AT&T Labs Research, USA (2010)"},{"key":"285_CR20","unstructured":"Spears, W.M., DeJong, K.A.: On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230\u2013236 (1991)"},{"key":"285_CR21","volume-title":"The C++ Programming Language","author":"B. Stroustrup","year":"1997","unstructured":"Stroustrup B.: The C++ Programming Language. Addison-Wesley, Reading (1997)"},{"key":"285_CR22","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/978-1-4613-0303-9_9","volume-title":"Handbook of Combinatorial Optimization, vol. 1","author":"R.R. Vemuganti","year":"1998","unstructured":"Vemuganti R.R.: Applications of set covering, set packing and set partitioning models: a survey. In: Du, D.-Z., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization, vol. 1, pp. 573\u2013746. Kluwer, Dordrecht (1998)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0285-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0285-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0285-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T10:34:54Z","timestamp":1559990094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0285-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,6]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["285"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0285-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,6]]}}}