{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T13:19:39Z","timestamp":1722777579021},"reference-count":82,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0166-218x(92)00184-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"111-138","source":"Crossref","is-referenced-by-count":11,"title":["A review of combinatorial problems arising in feedforward neural network design"],"prefix":"10.1016","volume":"52","author":[{"given":"E.","family":"Amaldi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Mayoraz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"de Werra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)00184-N_BIB1","series-title":"Simulated Annealing and Boltzmann Machines","author":"Aarts","year":"1989"},{"issue":"3","key":"10.1016\/0166-218X(92)00184-N_BIB2","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1162\/neco.1989.1.3.312","article-title":"The Vapnik\u2013Chervonenkis dimension: Information versus complexity in learning","volume":"1","author":"Abu-Mostafa","year":"1989","journal-title":"Neural Comput."},{"key":"10.1016\/0166-218X(92)00184-N_BIB3","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/0885-064X(90)90006-Y","article-title":"Learning from hints in neural networks","volume":"6","author":"Abu-Mostafa","year":"1990","journal-title":"J. Complexity"},{"key":"10.1016\/0166-218X(92)00184-N_BIB4","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1109\/TIT.1985.1057069","article-title":"Information capacity of the Hopfield model","author":"Abu-Mostafa","year":"1985","journal-title":"IEEE Trans. Inform. Theory IT-31"},{"key":"10.1016\/0166-218X(92)00184-N_BIB5","series-title":"Regression and the Moore\u2013Penrose Pseudoinverse","author":"Albert","year":"1972"},{"key":"10.1016\/0166-218X(92)00184-N_BIB6","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1162\/neco.1991.3.3.418","article-title":"Including hints in training neural nets","volume":"3","author":"Al-Mashouq","year":"1991","journal-title":"Neural Comput."},{"key":"10.1016\/0166-218X(92)00184-N_BIB7","series-title":"Modeling Brain Function: The World of Attractor Neural Networks","author":"Amit","year":"1989"},{"key":"10.1016\/0166-218X(92)00184-N_BIB8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0893-6080(88)90002-0","article-title":"Self-organizing feature maps and the travelling salesman problem","volume":"1","author":"Angeniol","year":"1988","journal-title":"Neural Networks"},{"key":"10.1016\/0166-218X(92)00184-N_BIB9","series-title":"Diploma Project","article-title":"Probl\u00e8mes d\u2019Apprentissage dans les R\u00e9seaux de Neurones","author":"Amaldi","year":"1988"},{"key":"10.1016\/0166-218X(92)00184-N_BIB10","doi-asserted-by":"crossref","first-page":"2333","DOI":"10.1051\/jphys:0198900500170233300","article-title":"Stability-capacity diagram of a neural network with Ising bonds","volume":"50","author":"Amaldi","year":"1989","journal-title":"J. Physique"},{"key":"10.1016\/0166-218X(92)00184-N_BIB11","series-title":"Artificial Neural Networks","first-page":"55","article-title":"On the Complexity of Training Perceptrons","author":"Amaldi","year":"1991"},{"key":"10.1016\/0166-218X(92)00184-N_BIB12","series-title":"Proc. Internat. Conf. on Artificial Neural Networks, EPF-Lausanne, Switzerland","first-page":"77","article-title":"Apprentissage dans les R\u00e9seaux de Hopfield","author":"Amaldi","year":"1989"},{"key":"10.1016\/0166-218X(92)00184-N_BIB13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)00184-N_BIB14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)00184-N_BIB15","series-title":"Complexity in Information Theory","article-title":"Complete representations for learning from examples","author":"Baum","year":"1988"},{"issue":"2","key":"10.1016\/0166-218X(92)00184-N_BIB16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1162\/neco.1989.1.2.201","article-title":"A proposal for more powerful learning algorithms","volume":"1","author":"Baum","year":"1989","journal-title":"Neural Comput."},{"issue":"22","key":"10.1016\/0166-218X(92)00184-N_BIB17","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1162\/neco.1990.2.2.248","article-title":"The perceptron algorithm is fast for nonmalicious distributions","volume":"2","author":"Baum","year":"1990","journal-title":"Neural Comput."},{"issue":"1","key":"10.1016\/0166-218X(92)00184-N_BIB18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","article-title":"What size net gives valid generalization?","volume":"1","author":"Baum","year":"1989","journal-title":"Neural Comput."},{"key":"10.1016\/0166-218X(92)00184-N_BIB19","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(92)00184-N_BIB20","series-title":"Proc. 1st Workshop on Computational Learning Theory","first-page":"9","article-title":"Training a 3-node neural network is NP-complete","author":"Blum","year":"1988"},{"key":"10.1016\/0166-218X(92)00184-N_BIB21","unstructured":"A. Blum and R. Rivest, Training a 3-node neural network is NP-complete, to appear in Neural Networks."},{"key":"10.1016\/0166-218X(92)00184-N_BIB22","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik\u2013Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)00184-N_BIB23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(92)90271-B","article-title":"Learning faster than promised by the Vapnik\u2013Chervonenkis dimension","volume":"24","author":"Blumer","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)00184-N_BIB24","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/0403015","article-title":"Harmonic analysis of polynomial threshold functions","volume":"3","author":"Bruck","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(92)00184-N_BIB25","first-page":"444","article-title":"Row-action methods for huge and sparse systems and their applications","volume":"14","author":"Censor","year":"1965","journal-title":"SIAM Rev."},{"key":"10.1016\/0166-218X(92)00184-N_BIB26","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","article-title":"Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition","volume":"14","author":"Cover","year":"1965","journal-title":"IEEE Trans. Electronic Comput."},{"key":"10.1016\/0166-218X(92)00184-N_BIB27","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02551274","article-title":"Approximation by superpositions of a sigmoidal function","volume":"2","author":"Cybenko","year":"1989","journal-title":"Math. Control Signals Systems"},{"key":"10.1016\/0166-218X(92)00184-N_BIB28","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1016\/0166-218X(92)00184-N_BIB29","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1038\/326689a0","article-title":"An analogue approach to the travelling salesman problem using an elastic net method","volume":"326","author":"Durbin","year":"1987","journal-title":"Nature"},{"key":"10.1016\/0166-218X(92)00184-N_BIB30","series-title":"Research Report ORWP90\/01","article-title":"A parallel tabu search algorithm for large traveling salesman problems","author":"Fiechter","year":"1990"},{"key":"10.1016\/0166-218X(92)00184-N_BIB31","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1088\/0954-898X\/2\/4\/002","article-title":"Evolving a learning algorithm for the binary perceptron","volume":"2","author":"Fontanari","year":"1991","journal-title":"Network: Comput. Neural Systems"},{"key":"10.1016\/0166-218X(92)00184-N_BIB32","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1162\/neco.1990.2.2.198","article-title":"The upstart algorithm: A method for constructing and training feedforward neural networks","volume":"2","author":"Frean","year":"1990","journal-title":"Neural Comput."},{"key":"10.1016\/0166-218X(92)00184-N_BIB33","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0893-6080(90)90089-4","article-title":"A connectionist learning algorithm with provable generalization and scaling bounds","volume":"3","author":"Gallant","year":"1990","journal-title":"Neural Networks"},{"key":"10.1016\/0166-218X(92)00184-N_BIB34","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/72.80230","article-title":"Perceptron-based learning algorithms","volume":"1","author":"Gallant","year":"1990","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/0166-218X(92)00184-N_BIB35","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"3","key":"10.1016\/0166-218X(92)00184-N_BIB36_1","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2013 Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"issue":"1","key":"10.1016\/0166-218X(92)00184-N_BIB36_2","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2013 Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0166-218X(92)00184-N_BIB37","series-title":"Neural and Automata Networks: Dynamical Behavior and Applications","author":"Goles","year":"1990"},{"key":"10.1016\/0166-218X(92)00184-N_BIB38","first-page":"407","article-title":"The CHIR algorithm: A generalization for multiple-output and multi-layered networks","volume":"3","author":"Grossman","year":"1989","journal-title":"Complex Systems"},{"key":"10.1016\/0166-218X(92)00184-N_BIB39","first-page":"555","article-title":"Learning by choice of internal representations","volume":"2","author":"Grossman","year":"1988","journal-title":"Complex Systems"},{"key":"10.1016\/0166-218X(92)00184-N_BIB40","series-title":"Introduction to the Theory of Neural Computation","author":"Hertz","year":"1991"},{"key":"10.1016\/0166-218X(92)00184-N_BIB41","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","article-title":"Neural networks and physical systems with emergent collective computational abilities","volume":"79","author":"Hopfield","year":"1982","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/0166-218X(92)00184-N_BIB42","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"Neural computation of decisions in optimization problems","volume":"52","author":"Hopfield","year":"1985","journal-title":"Biol. Cybernetics"},{"key":"10.1016\/0166-218X(92)00184-N_BIB43","series-title":"Tech. Rept. 87-60","article-title":"Complexity of connectionist learning with various node functions","author":"Judd","year":"1987"},{"key":"10.1016\/0166-218X(92)00184-N_BIB44","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0885-064X(88)90019-2","article-title":"On the complexity of loading shallow neural networks","volume":"4","author":"Judd","year":"1988","journal-title":"J. Complexity"},{"key":"10.1016\/0166-218X(92)00184-N_BIB45","series-title":"Neural Network Design and the Complexity of Learning","author":"Judd","year":"1990"},{"key":"10.1016\/0166-218X(92)00184-N_BIB46","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/BF00197648","article-title":"On problem solving with Hopfield neural networks","volume":"62","author":"Kamgar-Parsi","year":"1990","journal-title":"Biol. Cybernetics"},{"key":"10.1016\/0166-218X(92)00184-N_BIB47","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(92)00184-N_BIB48","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\/0166-218X(92)00184-N_BIB49","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-00784-6","article-title":"Self-Organization and Associative Memory","author":"Kohonen","year":"1988"},{"key":"10.1016\/0166-218X(92)00184-N_BIB50","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1088\/0305-4470\/20\/11\/013","article-title":"Learning algorithms with optimal stability in neural networks","volume":"20","author":"Krauth","year":"1987","journal-title":"J. Phys. A: Math. Gen."},{"key":"10.1016\/0166-218X(92)00184-N_BIB51","doi-asserted-by":"crossref","first-page":"3057","DOI":"10.1051\/jphys:0198900500200305700","article-title":"Storage capacity of memory, networks with binary couplings","volume":"50","author":"Krauth","year":"1989","journal-title":"J. Phys. France"},{"key":"10.1016\/0166-218X(92)00184-N_BIB52","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1088\/0305-4470\/22\/11\/012","article-title":"Critical storage capacity of the J = \u00b1 1 neural network","volume":"22","author":"Krauth","year":"1989","journal-title":"J. Phys. A: Math. Gen."},{"key":"10.1016\/0166-218X(92)00184-N_BIB53","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1162\/neco.1989.1.4.541","article-title":"Back-propagation applied to handwritten zip code recognition","volume":"1","author":"LeCum","year":"1989","journal-title":"Neural Comput."},{"key":"10.1016\/0166-218X(92)00184-N_BIB54","doi-asserted-by":"crossref","DOI":"10.1109\/MASSP.1987.1165576","article-title":"An introduction to computing with neural nets","author":"Lippmann","year":"1987","journal-title":"IEE ASSP Magazine"},{"key":"10.1016\/0166-218X(92)00184-N_BIB55","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1209\/0295-5075\/11\/6\/001","article-title":"A convergence theorem for sequential learning in two-layer perceptrons","volume":"11","author":"Marchand","year":"1990","journal-title":"Europhys. Lett."},{"key":"10.1016\/0166-218X(92)00184-N_BIB56","first-page":"477","article-title":"Benchmark of some learning algorithms for single layer and Hopfield networks","volume":"4","author":"Mayoraz","year":"1990","journal-title":"Complex Systems"},{"key":"10.1016\/0166-218X(92)00184-N_BIB57","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02478259","article-title":"A logical calculus of the ideas immanent in nervous activity","volume":"5","author":"McCulloch","year":"1943","journal-title":"Bull. Math. Biophys."},{"key":"10.1016\/0166-218X(92)00184-N_BIB58","doi-asserted-by":"crossref","first-page":"2191","DOI":"10.1088\/0305-4470\/22\/12\/019","article-title":"Learning in feedforward layered networks: the tiling algorithm","volume":"22","author":"M\u00e9zard","year":"1989","journal-title":"J. Phys. A: Math. Gen."},{"key":"10.1016\/0166-218X(92)00184-N_BIB59","series-title":"Perceptrons: An Introduction to Computational Geometry","author":"Minsky","year":"1988"},{"key":"10.1016\/0166-218X(92)00184-N_BIB60","series-title":"Threshold Logic and Its Applications","author":"Muroga","year":"1971"},{"issue":"1","key":"10.1016\/0166-218X(92)00184-N_BIB61","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1142\/S0129065789000463","article-title":"Study of a growth algorithm for a feedforward network","volume":"1","author":"Nadal","year":"1989","journal-title":"Int. J. Neural Systems"},{"key":"10.1016\/0166-218X(92)00184-N_BIB62","unstructured":"P. Peretto, An introduction to the modeling of neural networks, in press."},{"key":"10.1016\/0166-218X(92)00184-N_BIB63","series-title":"Lecture Notes in Computer Science 540","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/BFb0035889","article-title":"Learning algorithm for feedforward neural networks with discrete synapses","author":"P\u00e9rez Vicente","year":"1991"},{"key":"10.1016\/0166-218X(92)00184-N_BIB64","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/S0129065789000414","article-title":"A new method for mapping optimization problems onto neural networks","volume":"1","author":"Peterson","year":"1989","journal-title":"Int. J. Neural Systems"},{"key":"10.1016\/0166-218X(92)00184-N_BIB65","series-title":"Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanisms","author":"Rosenblatt","year":"1962"},{"key":"10.1016\/0166-218X(92)00184-N_BIB66","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1038\/323533a0","article-title":"Learning representations by back-propagating errors","volume":"323","author":"Rumelhart","year":"1986","journal-title":"Nature"},{"key":"10.1016\/0166-218X(92)00184-N_BIB67","first-page":"107","volume":"4","author":"Saad","year":"1990","journal-title":"Learning by choice of internal representations: An energy minimization approach Complex Systems"},{"key":"10.1016\/0166-218X(92)00184-N_BIB68","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","article-title":"On the density of families of sets","volume":"13","author":"Sauer","year":"1972","journal-title":"J. Combin. Theory (A)"},{"key":"10.1016\/0166-218X(92)00184-N_BIB69","first-page":"145","article-title":"Parallel networks that learn to pronounce english text","volume":"1","author":"Sejnowski","year":"1987","journal-title":"Complex Systems"},{"key":"10.1016\/0166-218X(92)00184-N_BIB70","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1088\/0954-898X\/2\/1\/006","article-title":"Sample sizes for multiple-output threshold networks","volume":"2","author":"Shawe-Taylor","year":"1991","journal-title":"Network"},{"key":"10.1016\/0166-218X(92)00184-N_BIB71","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0377-2217(82)90071-6","article-title":"On relaxation methods for systems of linear inequalities","volume":"9","author":"Telgen","year":"1982","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/0166-218X(92)00184-N_BIB72","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1162\/neco.1989.1.3.382","article-title":"Asymptotic convergence of back-propagation","volume":"1","author":"Tesauro","year":"1989","journal-title":"Neural Comput."},{"key":"10.1016\/0166-218X(92)00184-N_BIB73","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(92)00184-N_BIB74","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/0166-218X(92)00184-N_BIB75","series-title":"Estimation of Dependences Based on Empirical Data","author":"Vapnik","year":"1982"},{"key":"10.1016\/0166-218X(92)00184-N_BIB76","series-title":"Presented at the Workshop on Neural Networks for Computing","article-title":"Directed drift: A new linear threshold algorithm for learning binary weights on-line","author":"Venkatesh","year":"1989"},{"key":"10.1016\/0166-218X(92)00184-N_BIB77","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/0885-064X(91)90040-5","article-title":"Programmed interactions in higher-order neural networks: Maximum capacity","volume":"7","author":"Venkatesh","year":"1991","journal-title":"J. Complexity"},{"key":"10.1016\/0166-218X(92)00184-N_BIB78","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(81)90274-0","article-title":"Some special Vapnik\u2014Chervonenkis classes","volume":"33","author":"Wenocur","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)00184-N_BIB79","series-title":"Ph.D. Thesis","article-title":"Beyond regression: New tools for prediction and analysis in the behavioral sciences","author":"Werbos","year":"1974"},{"key":"10.1016\/0166-218X(92)00184-N_BIB80","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","article-title":"Tabu search techniques: A tutorial and an application to neural networks","volume":"11","author":"de Werra","year":"1989","journal-title":"OR Spektrum"},{"key":"10.1016\/0166-218X(92)00184-N_BIB81","first-page":"96","volume":"4","author":"Widrow","year":"1960","journal-title":"Adaptative switching circuits 1960 IRE WESCON Convention Record"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9200184N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9200184N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T15:53:16Z","timestamp":1681833196000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9200184N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":82,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0166218X9200184N"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)00184-n","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}