{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T18:11:26Z","timestamp":1777399886096,"version":"3.51.4"},"reference-count":80,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0305-0548(93)e0023-m","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"111-134","source":"Crossref","is-referenced-by-count":224,"title":["Genetic algorithms and tabu search: Hybrids for optimization"],"prefix":"10.1016","volume":"22","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James P.","family":"Kelly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(93)E0023-M_BIB1","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"5","author":"Glover","year":"1986","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB2","doi-asserted-by":"crossref","unstructured":"F. Glover, Tabu search\u2014part I. ORSA Jl Comput. 1, 190\u2013206.","DOI":"10.1287\/ijoc.1.3.190"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB3","article-title":"The steepest ascent mildest descent heuristic for combinatorial programming","author":"Hansen","year":"1986","journal-title":"Numerical Methods in Combinatorial Optimization"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB4","series-title":"Modern Heuristic Techniques for Combinatorial Problems","article-title":"Tabu search","author":"Glover","year":"1993"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB5","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0305-0548(86)90050-X","article-title":"The general employee scheduling problem: an integration of management science and artificial intelligence","volume":"15","author":"Glover","year":"1986","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB6","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","article-title":"A new method for the flow sequencing problem","volume":"41","author":"Widmer","year":"1989","journal-title":"Eur. J. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","article-title":"Some efficient heuristic methods for the flowshop sequencing problem","volume":"47","author":"Taillard","year":"1990","journal-title":"Eur. J. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1057\/jors.1991.9","article-title":"Job shop scheduling with tooling constraints: a tabu search approach","volume":"24","author":"Widmer","year":"1991","journal-title":"J. Opl Res. Soc."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB9","doi-asserted-by":"crossref","unstructured":"J. Bovet, C. Constantin and D. de Werra, A convoy scheduling problems. Discrete Appl. Math. (in press).","DOI":"10.1016\/0166-218X(91)90009-L"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01471219","article-title":"Tabu search methods for a single machine scheduling problem","volume":"2","author":"Laguna","year":"1991","journal-title":"J. Intell. Manufac."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01471113","article-title":"A search heuristic for just-in-time scheduling in parallel machines","volume":"2","author":"Laguna","year":"1991","journal-title":"J. Intell. Manufac."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/07408179308964284","article-title":"Solving the multiple-machine weighted flow time problem using tabu search","volume":"25","author":"Barnes","year":"1993","journal-title":"IIE Trans."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF02023075","article-title":"A tabu search heuristic for the flexible-resource flow shop scheduling problem","volume":"41","author":"Daniels","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying tabu search to the job-shop scheduling problem","volume":"41","author":"Dell'Amico","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0957-4174(93)90056-C","article-title":"Integrating target analysis and tabu search for improved scheduling systems","volume":"6","author":"Laguna","year":"1993","journal-title":"Expert Systems Applic."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02023077","article-title":"Tabu search for a class of scheduling problems","volume":"41","author":"Mooney","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1111\/j.1937-5956.1992.tb00341.x","article-title":"Sequencing and batching for two classes of jobs with deadlines and setup times","volume":"1","author":"Woodruff","year":"1992","journal-title":"Prod. Ops Mangmnt"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02022093","article-title":"Serial and parallel simulated annealing and tabu search algorithms for the travelling salesman problem","volume":"21","author":"Malek","year":"1989","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB19","series-title":"Ejection chains, reference structures, and alternating path methods for the traveling salesman problem","author":"Glover","year":"1992"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB20","doi-asserted-by":"crossref","unstructured":"M. Gendreau, A. Hertz and G. Laporte, A tabu search heuristic for the vehicle routing problem. Mangmnt Sci. (in press).","DOI":"10.1287\/mnsc.40.10.1276"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB21","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB22","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/BF02023006","article-title":"Solving real-life vehicle routing problems efficiently using taboo search","volume":"41","author":"Semet","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","article-title":"Tabu search applied to the quadratic assignment problem","volume":"2","author":"Skorin-Kapov","year":"1990","journal-title":"ORSA J. Comp."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB24","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Taboo search for the quadratic assignment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Comput."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB25","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02022999","article-title":"Massively parallel tabu search for the quadratic assignment problem","volume":"41","author":"Chakrapani","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB26","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0010-4485(91)90089-F","article-title":"Tabu search and design optimization","volume":"23","author":"Bland","year":"1991","journal-title":"Computer-Aided Des."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB27","first-page":"1","article-title":"A parallel version of tabu search and the path assignment problem","volume":"4","author":"Oliveira","year":"1989","journal-title":"Heuristics Combinat. Optimiz."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB28","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF02022997","article-title":"Path assignment for call routing: an application of tabu search","volume":"41","author":"Anderson","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB29","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.39.4.492","article-title":"Bandwidth packing: a tabu search approach","volume":"39","author":"Glover","year":"1993","journal-title":"Mangmnt Sci."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB30","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF02023611","article-title":"Interactive decision software and computer graphics for architectual and space planning","volume":"5","author":"Glover","year":"1985","journal-title":"Ann. Ops. Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB31","unstructured":"P. Hansen, B. Jaumard and Da Silva, Average linkage divisive hierarchical clustering. J. Classif. (in press)."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB32","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/ijoc.6.2.141","article-title":"Fast clustering algorithms","volume":"6","author":"Dorndorf","year":"1994","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB33","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","article-title":"Using tabu search techniques for graph coloring","volume":"29","author":"Hertz","year":"1987","journal-title":"Computing"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB34","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(94)90212-7","article-title":"Topology of local optima for the K-coloring problem","volume":"49","author":"Hertz","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB35","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","article-title":"Stabulus: a technique for finding stable sets in large graphs with tabu search","volume":"42","author":"Friden","year":"1989","journal-title":"Computing"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB36","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","article-title":"Solving the maximum clique problem using a tabu search approach","volume":"41","author":"Gendreau","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB37","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02241270","article-title":"Algorithms for the maximum satisfiability problem","volume":"44","author":"Hansen","year":"1990","journal-title":"Computing"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB38","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/ijoc.3.2.135","article-title":"Column generation methods for probabilistic logic","volume":"3","author":"Jaumard","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB39","series-title":"Proc. 2nd Integer Programming and Combinatorial Optimization Conf.","article-title":"Mixed integer column generation algorithms and the probabilistic maximum satisfiability problem","author":"Hansen","year":"1992"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB40","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","article-title":"Tabu search technique: a tutorial and an applications to neural networks","volume":"11","author":"de Werra","year":"1989","journal-title":"OR Spectrum"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB41","series-title":"Proc. Int. Joint Conf. Neural Networks","article-title":"Tabu learning: a neural network search method for solving nonconvex optimization problems","author":"Beyer","year":"1991"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB42","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02022561","article-title":"Dynamic tabu list management using the reverse elimination method","volume":"41","author":"Dammeyer","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB43","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02022563","article-title":"Large-scale controlled rounding using tabu search with strategic oscillation","volume":"41","author":"Kelly","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB44","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF02023003","article-title":"Tabu search applied to the general fixed charge problem","volume":"41","author":"Sun","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB45","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","article-title":"A user's guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Ann. Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB46","series-title":"Genetic Algorithms in Sarach, Optimization, and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB47","year":"1991"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB48","series-title":"A Connectionist Model for Genetic Hillclimbing","author":"Ackley","year":"1987"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB49","series-title":"Technical Report CS90-07","article-title":"An intuitive introduction to genetic algorithms as adaptive optimizing procedures","author":"Davidor","year":"1990"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB50","series-title":"Computing Science Notes, 89\/8","article-title":"A general theory of genetic algorithms","author":"Aarts","year":"1989"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB51","unstructured":"H. M\u00fchlenbein, Parallel genetic algorithms in combinatorial optimization. Computer Science and Operations Research (Edited by Osman Balci), Pergamon Press, Oxford (in press)."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB52","series-title":"Genetic algorithms are NOT function optimizers","author":"DeJong","year":"1992"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB53","series-title":"Evolution based learning in a job shop scheduling environment","author":"Dorndorf","year":"1992"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB54","series-title":"Conf. Genetic Algorithms","article-title":"Job shop scheduling with genetic algorithms","author":"Davis","year":"1985"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB55","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0167-8191(87)90026-3","article-title":"New solutions to the mapping problem of parallel systems\u2014the evolution approach","volume":"6","author":"M\u00fchlenbein","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB56","series-title":"Starkweather and Fuquay, Scheduling problems and traveling salesmen: the genetic edge recombination operator","author":"Whitley","year":"1989"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB57","series-title":"Proc. 1st Int. Conf. Genetic Algorithms and Their Applications","first-page":"160","article-title":"Genetic algorithms for the traveling salesman problem","author":"Grefenstette","year":"1985"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB58","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-8191(88)90098-1","article-title":"Evolution algorithms in combinatorial optimization","volume":"7","author":"M\u00fchlenbein","year":"1988","journal-title":"Parallel Comput."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB59","series-title":"Proc. 1989 Int. Joint Conf. Artificial Intelligence","article-title":"Training feedforward neural networks using genetic algorithms","author":"Montana","year":"1989"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB60","unstructured":"C.L. Huntley and D.E. Brown, Parallel genetic algorithms with local search. The Institute for Parallel Computation and The Department of Systems Engineering."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB61","doi-asserted-by":"crossref","unstructured":"N.L.J. Ulder, E. Pesch, P.J.M. van Laarhoven, H.J. Bandelt and E.H.L. Aarts, Genetic local search algorithm for the traveling salesman problem, Parallel Problem Solving from Nature (Edited by R. Maenner and H.P. Schwefel), Lectures in Computer Science, Vol. 496, pp. 109\u2013116 Springer, Berlin.","DOI":"10.1007\/BFb0029740"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB62","series-title":"Proc. 1991 Int. Conf. Genetic Algorithms","article-title":"Delta coding: an iterative search strategy for genetic algorithms","author":"Whitley","year":"1991"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB63","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","article-title":"Heuristics for integer programming using surrogate constraints","volume":"8","author":"Glover","year":"1997","journal-title":"Decision Sci."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB64","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB65","first-page":"131","article-title":"A bound escalation method for the solution of integer linear programs","volume":"6","author":"Glover","year":"1964","journal-title":"Cahiers Rech. Op."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB66","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1137\/0307015","article-title":"Integer programming over a finite additive group","volume":"7","author":"Glover","year":"1969","journal-title":"SIAM Jl Control"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB67","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF01584977","article-title":"Cut search methods in integer programming","volume":"3","author":"Glover","year":"1972","journal-title":"Math. Progr."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB68","series-title":"Proc. 4th Int. Conf. Genetic Algorithms","first-page":"2","article-title":"A survey of evolution strategies","author":"B\u00e4ck","year":"1991"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB69","series-title":"Real-coded genetic algorithms and interval-schemata","author":"Eschelman","year":"1992"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB70","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1287\/ijoc.3.4.307","article-title":"A non-standard genetic algorithm for the nonlinear transportation problem","volume":"3","author":"Michalewicz","year":"1991","journal-title":"ORSA Jl on Computing"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB71","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","article-title":"Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)","volume":"49","author":"Glover","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB72","first-page":"493","article-title":"Messy genetic algorithms: motivation, analysis and first results","volume":"3","author":"Goldberg","year":"1989","journal-title":"Complex Systems"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB73","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/09528139008953717","article-title":"Representational issues in genetic optimization","volume":"2","author":"Liepins","year":"1990","journal-title":"J. Exp. Theoret. Artific. Intell."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB74","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/ijoc.4.1.32","article-title":"Some convergence results for probabilistic tabu search","volume":"4","author":"Faigle","year":"1992","journal-title":"ORSA Jl Comput."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB75","doi-asserted-by":"crossref","DOI":"10.1016\/0305-0548(94)90018-3","article-title":"A study of diversification strategies for the quadratic assignment problem","volume":"21","author":"Kelly","year":"1994","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB76","unstructured":"M. Laguna, J. P. Kelly, J. L. Gonzalez-Verlarde and F. Glover, Tabu search for the multilevel generalized assignment problem. Graduate School of Business and Administration, Eur. J. Ops Res. (in press)."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB77","unstructured":"C. Reeves, Improving the efficiency of tabu search for machine sequencing problems. J. Ops Res. Soc. (in press)."},{"key":"10.1016\/0305-0548(93)E0023-M_BIB78","series-title":"Proc. 3rd Int. Conf. Genetic Algorithms","article-title":"Uniform crossover in genetic algorithms","author":"Syswerda","year":"1989"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB79","series-title":"Proc. Rocky Mountain Conf. Artificial Intelligence","article-title":"GENITOR: a different genetic algorithm","author":"Whitley","year":"1988"},{"key":"10.1016\/0305-0548(93)E0023-M_BIB80","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02022565","article-title":"Hashing vectors for tabu search","volume":"41","author":"Woodruff","year":"1993","journal-title":"Ann. Ops Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054893E0023M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054893E0023M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T03:18:14Z","timestamp":1578885494000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054893E0023M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":80,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["0305054893E0023M"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(93)e0023-m","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}