{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:39:53Z","timestamp":1649176793856},"reference-count":20,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":["Pattern Recognition Letters"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0167-8655(97)00019-6","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T18:50:41Z","timestamp":1053370241000},"page":"311-318","source":"Crossref","is-referenced-by-count":6,"title":["Genetic annealing search for index assignment in vector quantization"],"prefix":"10.1016","volume":"18","author":[{"given":"Tomasz","family":"Ostrowski","sequence":"first","affiliation":[]},{"given":"Vesa T.","family":"Ruoppila","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB1","series-title":"Genetic Algorithms","first-page":"86","article-title":"Schema survival rates and heuristic search in genetic algorithms","author":"Buckles","year":"1994"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB2","author":"Davis","year":"1991"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB3","series-title":"Proc. 20th International Symposium on Fault-Tolerant Computing (FFTCS 20)","article-title":"Optimized synthesis of self-testable finite state machines","author":"Eschermann","year":"1990"},{"issue":"4","key":"10.1016\/S0167-8655(97)00019-6_NEWBIB4","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1109\/18.53739","article-title":"A study of vector quantization for noisy channels","volume":"36","author":"Farvardin","year":"1990","journal-title":"IEEE Trans. on Information Theory"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB5","first-page":"61","article-title":"Quadratic assignment problems","volume":"31","author":"Finke","year":"1987","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB6","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB7","series-title":"Vector Quantization and Signal Compression","author":"Gersho","year":"1992"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB8","article-title":"Competitive learning in robust communication","author":"Knagenhjelm","year":"1993"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Knagenhjelm, P. (1996). Private communication.","DOI":"10.1109\/18.508837"},{"issue":"4","key":"10.1016\/S0167-8655(97)00019-6_NEWBIB10","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1109\/18.508837","article-title":"The Hadamard transform \u2014 A tool for index assignment","volume":"42","author":"Knagenhjelm","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"issue":"1","key":"10.1016\/S0167-8655(97)00019-6_NEWBIB12","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TCOM.1980.1094577","article-title":"An algorithm for vector quantizer design","volume":"28","author":"Linde","year":"1980","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB13","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","article-title":"An experimental comparison of techniques for the assignment of facilities to locations","volume":"16","author":"Nugent","year":"1968","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/S0167-8655(97)00019-6_NEWBIB14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0167-8655(94)00080-M","article-title":"Computing with genetic algorithms in the context of adaptive neural filtering","volume":"16","author":"Ostrowski","year":"1995","journal-title":"Pattern Recognition Letters"},{"issue":"2\u20134","key":"10.1016\/S0167-8655(97)00019-6_NEWBIB15","first-page":"805","article-title":"Minimax non-redundant channel coding","volume":"43","author":"Potter","year":"1995","journal-title":"IEEE Trans. on Communications"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB16","first-page":"128","article-title":"Genetic annealing","volume":"10","author":"Price","year":"1994","journal-title":"Dr. Dobb's Journal"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB17","series-title":"Objective Measures of Speech Quality","author":"Quackenbush","year":"1988"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB18","article-title":"Comparison of iterative searches for the quadratic assignment problem","author":"Taillard","year":"1994","journal-title":"Location Science"},{"key":"10.1016\/S0167-8655(97)00019-6_NEWBIB19","series-title":"Telecommunications Industry Association\/Electronic Industry Association\/Interim Standard 641","article-title":"TDMA Cellular\/PCS \u2014 Radio Interface \u2014 Enhanced Full-Rate Speech Codec","author":"TIA\/EIA\/IS-641","year":"1996"},{"issue":"12","key":"10.1016\/S0167-8655(97)00019-6_NEWBIB20","doi-asserted-by":"crossref","first-page":"2147","DOI":"10.1109\/26.64657","article-title":"Pseudo-Gray coding","volume":"38","author":"Zeger","year":"1990","journal-title":"IEEE Trans. Commun."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865597000196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865597000196?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T06:29:39Z","timestamp":1555568979000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865597000196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0167865597000196"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(97)00019-6","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}