{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T14:40:11Z","timestamp":1704120011879},"reference-count":13,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":["Computer Networks"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s1389-1286(01)00158-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T14:29:16Z","timestamp":1034605756000},"page":"311-321","source":"Crossref","is-referenced-by-count":2,"title":["Optimization of web newspaper layout in real time"],"prefix":"10.1016","volume":"36","author":[{"given":"J.","family":"Gonz\u00e1lez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Rojas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Pomares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Salmer\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Prieto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.J.","family":"Merelo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(01)00158-X_BIB1","series-title":"Simulated Annealing and Boltzmann Machines","author":"Aarts","year":"1989"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB2","unstructured":"Netscape Communications Corporation, JavaScript Developer Central, Web address: http:\/\/developer.netscape.com\/tech\/javascript"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB3","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB4","doi-asserted-by":"crossref","unstructured":"J. Gonz\u00e1lez, J.J. Merelo, Optimizing web page layout using an annealed genetic algorithm as client-side script, in: Lecture Notes in Computer Science, vol. 1498, Springer, New York, 1998, pp. 1018\u20131027","DOI":"10.1007\/BFb0056943"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB5","doi-asserted-by":"crossref","unstructured":"J. Gonz\u00e1lez, J.J. Merelo, P.A. Castillo, V. Rivas, G. Romero, Optimizing web newspaper layout using simulated annealing, in: Lecture Notes in Computer Science, vol. 1607, Springer, New York, 1999, pp. 759\u2013768","DOI":"10.1007\/BFb0100543"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB6","unstructured":"W.H. Graf, Graf's home page, Web address: http:\/\/www.dfki.de\/\u223cgraf\/"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB7","unstructured":"J.J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB8","doi-asserted-by":"crossref","unstructured":"O. Kamba, K. Bharat, M.C. Albers, The Krakatoa chronicle \u2013 an interactive, personalized newspaper on the Web, Technical Report Number 95-25, Technical Report, Graphics, Visualisation and Usability Center, Georgia Institute of Technology, Atlanta, GA, 1995","DOI":"10.1145\/3592626.3592638"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB9","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/BF01009452","article-title":"Optimization by simulated annealing \u2013 quantitative studies","volume":"34","author":"Kirkpatrick","year":"1984","journal-title":"J. Stat. Phys."},{"key":"10.1016\/S1389-1286(01)00158-X_BIB10","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB11","doi-asserted-by":"crossref","unstructured":"K. Lagus, I. Karanta, J. Yl\u0101a-J\u0101\u0101ski, Paginating the generalized newspapers \u2013 a comparison of simulated annealing and a heuristic method, in: H.-M. Voigt, W. Ebeling, I. Rechenberg, H.-P. Schwefel (Eds.), Proceedings of the Fourth Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, vol. 1141, Springer, Berlin, September 1996, pp. 595\u2013603","DOI":"10.1007\/3-540-61723-X_1023"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB12","series-title":"Bin Packing Problem, in: Knapsack Problems, Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S1389-1286(01)00158-X_BIB13","series-title":"Genetic Algorithms + Data Structures=Evolution Programs","author":"Michalewicz","year":"1996"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138912860100158X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138912860100158X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T13:58:38Z","timestamp":1704117518000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S138912860100158X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":13,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S138912860100158X"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(01)00158-x","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}