{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:37:49Z","timestamp":1725493069814},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009764"},{"type":"electronic","value":"9783540366058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36605-9_26","type":"book-chapter","created":{"date-parts":[[2007,10,26]],"date-time":"2007-10-26T17:03:42Z","timestamp":1193418222000},"page":"280-290","source":"Crossref","is-referenced-by-count":19,"title":["A Genetic Algorithm for the Index Selection Problem"],"prefix":"10.1007","author":[{"given":"Jozef","family":"Kratica","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Du\u0161an","family":"To\u0161i\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"J. Krarup","year":"1983","unstructured":"J. Krarup and P.M. Pruzan. The simple plant location problem: Survey and synthesis. European Journal of Operational Research, 12:36\u201381, 1983.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0377-2217(84)90258-3","volume":"18","author":"D. W. Tcha","year":"1984","unstructured":"D. W. Tcha and B.-Y. Lee. A branch-and-bound algorithm for the multilevel uncapacitated facility location problem. European Jornal of Operational Research, 18(1):35\u201343, 1984.","journal-title":"European Jornal of Operational Research"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Y. A. Kochetov and E. N. Goncharov. Probabilistic tabu search algorithm for the multi-stage uncapacitated facility location problem. In B. Fleischmann, R. Lasch, U. Derigs, W. Domschke, and U. Rieder, editors, Operations Research Proceedings 2000, pages 65\u201370. Springer, 2000.","DOI":"10.1007\/978-3-642-56656-1_11"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"E. Barcucci, R. Pinzani, and R. Sprugnoli. Optimal selection of secondary indexes. IEEE Transactions on Software Engineering, 16, 1990.","DOI":"10.1109\/32.44361"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"M.Y.L. Ip, L.V. Saxton, and V.V. Raghavan. On the selection of an optimal set of indexes. IEEE Transactions on Software Engineering, pages 135\u2013143, 1983.","DOI":"10.1109\/TSE.1983.236458"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"A. Caprara, M. Fischetti, and D. Maio. Exact and approximate algorithms for the index selection problem in physical database design. IEEE Transactions on Knowledge and Data Engineering, 7(6), 1995.","DOI":"10.1109\/69.476501"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/42201.42205","volume":"13","author":"S. Finkelstein","year":"1988","unstructured":"S. Finkelstein, M. Schkolnick, and P. Tiberio. Physical database design for relational databases. ACM Transactions on Database Systems, 13:91\u2013128, 1988.","journal-title":"ACM Transactions on Database Systems"},{"issue":"1","key":"26_CR8","first-page":"135","volume":"4","author":"A. Caprara","year":"1996","unstructured":"A. Caprara and J.J. Salazar Gonzalez. A branch-and-cut algorithm for a generalization of the uncapacitated facility location. Problem Trabajos de Operativa-TOP, 4(1):135\u2013163, 1996.","journal-title":"Problem Trabajos de Operativa-TOP"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0166-218X(99)00050-5","volume":"92","author":"A. Caprara","year":"1999","unstructured":"A. Caprara and J.J Salazar Gonzalez. Separating lifted odd-hole inequalities to solve the index selection problem. Discrete Applied Mathematics, 92:111\u2013134, 1999.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"26_CR10","first-page":"271","volume":"18","author":"J. Kratica","year":"1999","unstructured":"J. Kratica. Improving performances of the genetic algorithm by caching. Computers and Artificial Intelligence, 18(3):271\u2013283, 1999.","journal-title":"Computers and Artificial Intelligence"},{"key":"26_CR11","unstructured":"J. Kratica. Parallelization of Genetic Algorithms for Solving Some NP-complete Problems (in Serbian). PhD thesis, Faculty of Mathematics, Belgrade, 2000."},{"key":"26_CR12","unstructured":"G. Syswerda. Uniform crossover in genetic algorithms. In 3th International Conference on Genetic ALgorithms, ICGA\u201989, pages 2\u20139, Internet, 1989. Morgan Kaufmann, San Mateo, Calif."},{"key":"26_CR13","unstructured":"V. Filipovi\u0107. Proposition for improvement tournament selection operator in genetic algorithms (in serbian). Master\u2019s thesis, Faculty of Mathematics, Belgrade, 1998."},{"key":"26_CR14","unstructured":"V. Filipovi\u0107, J. Kratica, D. To\u0161i\u0107, and I. Ljubi\u0107. Fine grained tournament selection for the simple plant location problem. In 5th Online World Conference on Soft Computing Methods in Industrial Applications, WSC5, pages 152\u2013158, Internet, 2000. ISBN: 951-22-5205-8."},{"key":"26_CR15","volume-title":"Efficient and Accurate Parallel Genetic Algorithms","author":"E. Cantu-Paz","year":"2000","unstructured":"Erick Cantu-Paz. Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers, Boston, 2000."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36605-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T21:51:20Z","timestamp":1556920280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36605-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009764","9783540366058"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-36605-9_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}