{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:36:46Z","timestamp":1772023006260,"version":"3.50.1"},"reference-count":75,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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":5038,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1016\/s0166-218x(99)00100-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"395-442","source":"Crossref","is-referenced-by-count":106,"special_numbering":"C","title":["Mixed logical-linear programming"],"prefix":"10.1016","volume":"96-97","author":[{"given":"J.N.","family":"Hooker","sequence":"first","affiliation":[]},{"given":"M.A.","family":"Osorio","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00100-6_BIB1","doi-asserted-by":"crossref","unstructured":"A. Aiba, K. Sakai, Y. Sato, D.J. Hawley, R. Hasegawa, Constraint logic programming language CAL, Fifth Generation Computer Systems, Springer, Tokyo, 1988.","DOI":"10.1007\/978-1-4471-3156-4_27"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB2","doi-asserted-by":"crossref","unstructured":"E. Balas, Disjunctive programming: cutting planes from logical conditions, in: O.L. Mangasarian, R.R. Meyer, S.M. Robinson (Eds.), Nonlinear Programming, vol 2, Academic Press, New York, 1975, pp. 279\u2013312.","DOI":"10.1016\/B978-0-12-468650-2.50015-8"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB3","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/BF00933095","article-title":"A note on duality in disjunctive programming","volume":"21","author":"Balas","year":"1977","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","article-title":"Disjunctive programming","volume":"5","author":"Balas","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB5","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","article-title":"Mixed 0\u20131 programming by lift-and-project in a branch and cut framework","volume":"42","author":"Balas","year":"1996","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB6","doi-asserted-by":"crossref","unstructured":"P. Barth, Logic-Based 0\u20131 Constraint Programming, Kluwer Academic Publishers, Boston, 1995","DOI":"10.1007\/978-1-4613-1315-1"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB7","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0377-2217(90)90419-C","article-title":"An algorithm for disjunctive programs","volume":"48","author":"Beaumont","year":"1990","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB8","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/0377-2217(88)90175-0","article-title":"An algorithm for solving large capacitated warehouse location problems","volume":"3","author":"Beasley","year":"1988","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB9","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1137\/0131054","article-title":"Two rules for deducing valid inequalities for 0\u20131 problems","volume":"31","author":"Blair","year":"1976","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB10","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/0305-0548(86)90056-0","article-title":"Some results and experiments in programming techniques for propositional logic","volume":"13","author":"Blair","year":"1988","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB11","unstructured":"S. Bollapragada, O. Ghattas, J.N. Hooker, Optimal design of truss structures by mixed logical and linear programming, to appear in Operations Research."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB12","unstructured":"I. Bratko, PROLOG Programming for Artificial Intelligence, International Computer Science, Addison-Wesley, Reading, MA, 1986."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB13","unstructured":"BULL Corporation, CHARME VI User's Guide and Reference Manual, Artificial Intelligence Development Centre, BULL S.A., France, 1990."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB14","first-page":"33","article-title":"On renamable Horn and generalized Horn functions","volume":"1","author":"Chandru","year":"1990","journal-title":"Ann. Math. AI"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB15","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/102782.102789","article-title":"Extended Horn clauses in propositional logic","volume":"38","author":"Chandru","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB16","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(92)90098-G","article-title":"Detecting embedded Horn structure in propositional logic","volume":"42","author":"Chandru","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB17","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/79204.79210","article-title":"An introduction to Prolog III","volume":"33","author":"Colmerauer","year":"1990","journal-title":"Comm. ACM"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB18","unstructured":"A. Colmerauer, H. Kanouia, R. Pasero, P. Roussel, Un syst\u00e8me de communication homme-machine en fran\u00e7ais, Technical Report, Universit\u00e9 d'Aix-Marseilles II, Groupe intelligence artificielle, 1973."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(89)90080-5","article-title":"An optimal k-consistency algorithm","volume":"41","author":"Cooper","year":"1989","journal-title":"Artif. Intell."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB20","unstructured":"M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, F. Bertier, The constraint programming language CHIP, Proceedings on the International Conference on Fifth Generation Computer Systems FGCS-88, Tokyo, December 1988."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB21","unstructured":"A. Drexl, C. Jordan, A comparison of logic and mixed-integer programming solvers for batch sequencing with sequence-dependent setups, INFORMS J. Comput., to appear."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB22","doi-asserted-by":"crossref","unstructured":"E.C. Freuder, Exploiting structure in constraint satisfaction problems, in: B. Mayoh, E. Tyugu, J. Penjam (Eds.), Constraint Programming, Springer, Berlin, 1993, pp. 50\u201374.","DOI":"10.1007\/978-3-642-85983-0_3"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB23","doi-asserted-by":"crossref","unstructured":"F. Glover, Surrogate constraint duality in mathematical programming, Oper. Res. 23 434\u2013451.","DOI":"10.1287\/opre.23.3.434"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB24","unstructured":"F. Granot, P.L. Hammer, On the use of boolean functions in 0\u20131 linear programming, Methods Oper. Res. (1971) 154\u2013184."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB25","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB26","doi-asserted-by":"crossref","unstructured":"P.L. Hammer, S. Rudeanu, Boolean Methods in Operations Research and Related Areas, Springer, Berlin, 1968.","DOI":"10.1007\/978-3-642-85823-9"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(88)90044-2","article-title":"Resolution vs. cutting plane solution of inference problems: some computational experience","volume":"7","author":"Hooker","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB28","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02186368","article-title":"Generalized resolution and cutting planes","volume":"12","author":"Hooker","year":"1988","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB29","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-9236(88)90097-8","article-title":"A quantitative approach to logical inference","volume":"4","author":"Hooker","year":"1988","journal-title":"Decision Support Systems"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB30","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1287\/ijoc.1.3.137","article-title":"Input proofs and rank one cutting planes","volume":"1","author":"Hooker","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB31","first-page":"271","article-title":"Generalized resolution for 0\u20131 linear inequalities","volume":"6","author":"Hooker","year":"1992","journal-title":"Ann. Math. AI"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB32","doi-asserted-by":"crossref","unstructured":"J.N. Hooker, Logical inference and polyhedral projection, Proceedings, Computer Science Logic Workshop (CSL\u201991), Lecture Notes in Computer Science, vol. 626, Springer, Berlin, 1992, pp. 184\u2013200.","DOI":"10.1007\/BFb0023767"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB33","doi-asserted-by":"crossref","unstructured":"J.N. Hooker, Logic-based methods for optimization, in: A. Borning (Ed.), Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 874, Springer, Berlin, 1994, pp. 336\u2013349.","DOI":"10.1007\/3-540-58601-6_111"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB34","unstructured":"J.N. Hooker, Logic-based Benders decomposition, available at http:\/\/www.gsia.cmu.edu\/afs\/andrew\/gsia\/jh38\/jnh.html, 1995."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB35","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02430364","article-title":"Testing heuristics: we have it all wrong","volume":"1","author":"Hooker","year":"1995","journal-title":"J. Heuristics"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB36","doi-asserted-by":"crossref","unstructured":"J.N. Hooker, Constraint satisfaction methods for generating valid cuts, in: D.L. Woodruff, ed., Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search, Kluwer (1997) pp. 1\u201330. edu\/afs\/andrew\/gsia\/jh38\/jnh.html.","DOI":"10.1007\/978-1-4757-2807-1_1"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB37","unstructured":"J.N. Hooker, N.R. Natraj, Solving 0\u20131 optimization problems with k-tree relaxation, in preparation."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB38","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0305-0548(94)90089-2","article-title":"Logic cuts for processing networks with fixed charges","volume":"21","author":"Hooker","year":"1994","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB39","doi-asserted-by":"crossref","unstructured":"J. Jaffar, J.-L. Lassez, Constraint logic programming, Proceedings of the 14th ACM Symposium on Principles of Programming Languages, M\u00fcnchen, ACM, New York, 1987, pp. 111\u2013119.","DOI":"10.1145\/41625.41635"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB40","doi-asserted-by":"crossref","unstructured":"J. Jaffar, J.-L. Lassez, From unification to constraints, Logic programming 87, Proceedings of the Sixth Conference, Springer, Berlin, 1987, pp. 1\u201318.","DOI":"10.1007\/3-540-19426-6_1"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB41","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","article-title":"Representability in mixed integer programming, I: characterization results","volume":"17","author":"Jeroslow","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB42","unstructured":"R.E. Jeroslow, Logic-Based Decision Support: Mixed Integer Model Formulation, Annals of Discrete Mathematics, vol. 40, North-Holland, Amsterdam, 1989."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB43","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0121015","article-title":"Modeling with integer variables","volume":"22","author":"Jeroslow","year":"1984","journal-title":"Math. Programm. Stud."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB44","unstructured":"R.A. Kowalski, Predicate logic as programming language, Proceedings of the IFIP Congress, North-Holland, Amsterdam, 1974, pp. 569\u2013574."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB45","unstructured":"K. McAloon, C. Tretkoff, 2LP: linear programming and logic programming, in: P. van Hentenryck, V. Saraswat (Eds.), Principles and Practice of Constraint Programming, MIT Press, Cambridge, MA, 1995, pp. 99\u2013114."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB46","unstructured":"K. McAloon, C. Tretkoff, Optimization and Computational Logic, Wiley, New York, in preparation."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB47","first-page":"138","article-title":"Ein Beitrag zum Reihenfolgeproblem","volume":"4","author":"Piehler","year":"1960","journal-title":"Unternehmenforschung"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB48","unstructured":"J.-F. Puget, A C++ implementation of CLP, Technical Report 94-01, ILOG S.A., Gentilly, France, 1994."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB49","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1080\/00029890.1952.11988183","article-title":"The problem of simplifying truth functions","volume":"59","author":"Quine","year":"1952","journal-title":"Amer. Math. Mon."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB50","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1080\/00029890.1955.11988710","article-title":"A way to simplify truth functions","volume":"62","author":"Quine","year":"1955","journal-title":"Amer. Math. Mon."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB51","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0098-1354(91)87007-V","article-title":"Relation between MILP modeling and logical inference for chemical process synthesis","volume":"15","author":"Raman","year":"1991","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB52","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02023175","article-title":"Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks","volume":"42","author":"Raman","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB53","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/0098-1354(93)80073-V","article-title":"Symbolic integration of logic in mixed-integer linear programming techniques for process synthesis","volume":"17","author":"Raman","year":"1993","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB54","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","article-title":"Modeling and computational techniques for logic based integer programming","volume":"18","author":"Raman","year":"1994","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB55","first-page":"147","article-title":"Programming by constraints","volume":"104","author":"Remy","year":"1990","journal-title":"Micro Systemes"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB56","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB57","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1016\/0098-1354(89)87046-2","article-title":"Optimization model for long range planning in the chemical industry","volume":"13","author":"Sahinidis","year":"1989","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB58","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(95)00019-9","article-title":"On finding solutions for extended Horn formulas","volume":"54","author":"Schlipf","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB59","unstructured":"D. Sciamma, J. Gay, A. Guillard, CHARME: a constraint oriented approach to scheduling and resource allocation, Artificial Intelligence in the Pacific Rim, Proceedings of the Pacific Rim International Conference on Artificial Intelligent, Nagoya, Japan, 1990, pp. 71\u201376."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB60","unstructured":"C.-L. Sheng, Threshold Logic, Academic Press, New York, 1969."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB61","unstructured":"H. Simonis, M. Dincbas, Propositional calculus problems in CHIP, in: F. Benhamou, A. Colmerauer (Eds.), Constraint Logic Programming: Selected Research, MIT Press, Cambridge, MA, 1993, pp. 269\u2013285."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB62","doi-asserted-by":"crossref","unstructured":"B.M. Smith, S.C. Brailsford, P.M. Hubbard, H.P. Williams, The progressive party problem: Integer linear programming and constraint programming compared, in: U. Montanari, F. Rossi (Eds.), Proceedings of Principles and Practice of Constraint Programming, Cassis, France, Springer, Berlin, 1995, pp. 36\u201352.","DOI":"10.1007\/3-540-60299-2_3"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB63","unstructured":"L. Sterling, E. Shapiro, The Art of Prolog: Advanced Programming Techniques, MIT Press, Cambridge, MA, 1986."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB64","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(95)80005-O","article-title":"The arborescence-realization problem","volume":"59","author":"Swaminathan","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB65","unstructured":"E. Tsang, Foundations of Constraint Satisfaction, Academic Press, London, 1993."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB66","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/0098-1354(95)00219-7","article-title":"Logic-based MINLP algorithms for the optimal synthesis of process networks","volume":"20","author":"Turkay","year":"1996","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB67","unstructured":"P. Van Hentenryck, Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, MA, 1988."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB68","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0097-3165(76)90055-8","article-title":"Fourier-Motzkin elimination extension to integer programming problems","volume":"21","author":"Williams","year":"1976","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB69","first-page":"18","article-title":"Logical problems and integer programming","volume":"13","author":"Williams","year":"1977","journal-title":"Bull. Inst. Math. Implications"},{"key":"10.1016\/S0166-218X(99)00100-6_BIB70","first-page":"81","article-title":"Linear and integer programming applied to the propositional calculus","volume":"2","author":"Williams","year":"1987","journal-title":"Int. J. Systems Res. Inform. Sci."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB71","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0377-2217(94)90341-7","article-title":"An alternative explanation of disjunctive formulations","volume":"72","author":"Williams","year":"1994","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB72","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/0377-2217(93)E0359-6","article-title":"Logic applied to integer programming and integer programming applied to logic","volume":"81","author":"Williams","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB73","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0305-0548(90)90007-T","article-title":"Compact normal forms in propositional logic and integer programming formulations","volume":"90","author":"Wilson","year":"1990","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB74","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0377-2217(90)90302-R","article-title":"Generating cuts in integer programming with families of specially ordered sets","volume":"46","author":"Wilson","year":"1990","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00100-6_BIB75","unstructured":"J.M. Wilson, A note on logic cuts and valid inequalities for certain standard (0\u20131) integer programs, manuscript, Loughborough University Business School, Loughborough, Leicestershire LZE11 3TU, UK, 1995."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001006?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001006?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T09:50:11Z","timestamp":1584006611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":75,"alternative-id":["S0166218X99001006"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00100-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}