{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:09:42Z","timestamp":1771610982783,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0020-0190(01)00229-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"277-282","source":"Crossref","is-referenced-by-count":14,"title":["Improved lower bound on the Shannon capacity of C7"],"prefix":"10.1016","volume":"81","author":[{"given":"Aleksander","family":"Vesel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"\u017derovnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00229-0_BIB001","series-title":"Local Search Algorithms","author":"Aarts","year":"1997"},{"key":"10.1016\/S0020-0190(01)00229-0_BIB002","series-title":"Computers in Algebra and Number Theory","first-page":"97","article-title":"A combinatorial packing problem","author":"Baumert","year":"1971"},{"key":"10.1016\/S0020-0190(01)00229-0_BIB003","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1137\/S1052623497329683","article-title":"Simulated annealing: searching for an optimal temperature schedule","volume":"9","author":"Cohn","year":"1999","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0020-0190(01)00229-0_BIB004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0898-1221(93)90275-Z","article-title":"Bounding the probability of success of stochastic methods for global optimization","volume":"25","author":"Ferreira","year":"1993","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0020-0190(01)00229-0_BIB005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1224","article-title":"Problems in algebraic combinatorics","volume":"2","author":"Godsil","year":"1995","journal-title":"Electron. J. Combin."},{"key":"10.1016\/S0020-0190(01)00229-0_BIB006","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0167-6911(89)90081-9","article-title":"Simulated annealing \u2014 to cool or not","volume":"12","author":"Hajek","year":"1989","journal-title":"System Control Lett."},{"key":"10.1016\/S0020-0190(01)00229-0_BIB007","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0095-8956(73)90014-2","article-title":"Numerical invariants and the strong product of graphs","volume":"15","author":"Hales","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0020-0190(01)00229-0_BIB008","series-title":"Simulated Annealing, Theory and Applications","author":"Laarhoven","year":"1987"},{"key":"10.1016\/S0020-0190(01)00229-0_BIB009","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","author":"Lovasz","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0020-0190(01)00229-0_BIB010","doi-asserted-by":"crossref","first-page":"747","DOI":"10.2307\/1427186","article-title":"Convergence and finite time behavior of simulated annealing","volume":"18","author":"Mitra","year":"1986","journal-title":"Adv. in Appl. Probab."},{"key":"10.1016\/S0020-0190(01)00229-0_BIB011","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(89)90214-8","article-title":"A randomised 3-colouring algorithm","volume":"74","author":"Petford","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(01)00229-0_BIB012","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","article-title":"The zero-error capacity of a noisy channel","volume":"2","author":"Shannon","year":"1956","journal-title":"IRE Trans. Inform. Theory"},{"issue":"614","key":"10.1016\/S0020-0190(01)00229-0_BIB013","article-title":"Adapting temperature for some randomized local search algorithms","volume":"36","author":"Shawe-Taylor","year":"1998","journal-title":"Preprint Ser. Department of Math."},{"key":"10.1016\/S0020-0190(01)00229-0_BIB014","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0095-8956(74)90081-1","article-title":"Independence numbers of product graphs","volume":"17","author":"Sonnemann","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0020-0190(01)00229-0_BIB015","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0898-1221(98)00169-2","article-title":"The independence number of the strong product of cycles","volume":"36","author":"Vesel","year":"1998","journal-title":"Comput. Math. Appl."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002290?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002290?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T17:19:50Z","timestamp":1620321590000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0020019001002290"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00229-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}