{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:50:39Z","timestamp":1775249439443,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1007\/bf02592210","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:57:40Z","timestamp":1175183860000},"page":"159-195","source":"Crossref","is-referenced-by-count":35,"title":["An interior point potential reduction method for constrained equations"],"prefix":"10.1007","volume":"74","author":[{"given":"Tao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[]},{"given":"Jong-Shi","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02592210_CR1","volume-title":"A Primer of Nonlinear Analysis","author":"A. Ambrosetti","year":"1993","unstructured":"A. Ambrosetti and G. Prodi,A Primer of Nonlinear Analysis (Cambridge University Press, Cambridge, 1993)."},{"key":"BF02592210_CR2","first-page":"499","volume":"314","author":"D. Bayer","year":"1989","unstructured":"D. Bayer and J. C. Lagarias, \u201cThe nonlinear geometry of linear programming I: Affine and projective trajectories,\u201dTransactions of the American Mathematical Society 314 (1989) 499\u2013526.","journal-title":"Transactions of the American Mathematical Society"},{"key":"BF02592210_CR3","first-page":"527","volume":"314","author":"D. Bayer","year":"1989","unstructured":"D. Bayer and J. C. Lagarias, \u201cThe nonlinear geometry of linear programming II: Legendre transform coordinates and central trajectories,\u201dTransactions of the American Mathematical Society 314 (1989) 527\u2013581.","journal-title":"Transactions of the American Mathematical Society"},{"key":"BF02592210_CR4","volume-title":"Convergence of interior point algorithms for the monotone linear complementarity problem","author":"J. F. Bonnans","year":"1993","unstructured":"J. F. Bonnans and C. C. Gonzaga, \u201cConvergence of interior point algorithms for the monotone linear complementarity problem,\u201d manuscript, INRIA, Rocquencourt (1993)."},{"key":"BF02592210_CR5","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/BF01580667","volume":"10","author":"R. S. Dembo","year":"1976","unstructured":"R. S. Dembo, \u201cA set of geometric programming test problems and their solutions,\u201dMathematical Programming 10 (1976) 192\u2013213.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR6","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J. E. Dennis Jr.","year":"1983","unstructured":"J. E. Dennis Jr. and R. B. Schnabel,Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983)."},{"key":"BF02592210_CR7","volume-title":"LINPACK Users Guide","author":"J. Dongarra","year":"1978","unstructured":"J. Dongarra, J. R. Bunch, C. B. Moler and G. W. Stewart,LINPACK Users Guide (SIAM, Philadelphia, CA, 1978)."},{"key":"BF02592210_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.30.1.1","volume":"30","author":"A. V. Fiacco","year":"1982","unstructured":"A. V. Fiacco and A. Ghaemi, \u201cSensitivity analysis of a nonlinear water pollution control model using an upper Hudson River data base,\u201dOperations Research 30 (1982) 1\u201328.","journal-title":"Operations Research"},{"key":"BF02592210_CR9","unstructured":"A. V. Fiacco and A. Ghaemi, \u201cA sensitivity and parametric bound analysis of an electric power generator GP model: optimal steam turbine exhaust annulus and condenser sizes,\u201d Serial T-437 (Department of Operations Research, The George Washington University, 1981)."},{"key":"BF02592210_CR10","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A. V. Fiacco","year":"1968","unstructured":"A. V. Fiacco and G. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968) reprinted: SIAM Classics in Applied Mathematics, Vol. 4 (SIAM, Philadelphia, PA, 1990)."},{"key":"BF02592210_CR11","series-title":"Technical report","volume-title":"The logarithmic potential method of convex programming","author":"K. R. Frisch","year":"1955","unstructured":"K. R. Frisch, \u201cThe logarithmic potential method of convex programming,\u201d Technical report, University Institute of Economics, Oslo, Norway (1955)."},{"key":"BF02592210_CR12","first-page":"1","volume-title":"Progress in Mathematical Programming\u2014Interior Point and Related Methods","author":"C. Gonzaga","year":"1989","unstructured":"C. Gonzaga, \u201cAn algorithm for solving linear programming problems in O(n 3 L) operations, in: N. Megiddo, ed.,Progress in Mathematical Programming\u2014Interior Point and Related Methods (Springer, Berlin, 1989) pp. 1\u201328."},{"key":"BF02592210_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C. Gonzaga","year":"1992","unstructured":"C. Gonzaga, \u201cPath-following methods for linear programming,\u201dSIAM Review 34 (1992) 167\u2013224.","journal-title":"SIAM Review"},{"key":"BF02592210_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1093\/imanum\/11.3.299","volume":"11","author":"N.I.M. Gould","year":"1991","unstructured":"N.I.M. Gould, \u201cAn algorithm for large-scale quadratic programming,\u201dIMA Journal of Numerical Analysis 11 (1991) 299\u2013324.","journal-title":"IMA Journal of Numerical Analysis"},{"key":"BF02592210_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48320-2","volume-title":"Test Examples for Nonlinear Programming Codes","author":"W. Hock","year":"1981","unstructured":"W. Hock and K. Schittkowski,Test Examples for Nonlinear Programming Codes (Springer, Berlin, 1981)."},{"key":"BF02592210_CR16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A. J. Hoffman","year":"1952","unstructured":"A. J. Hoffman, \u201cOn approximate solutions of systems of linear inequalities,\u201dJournal of Research of the National Bureau of Standards 49 (1952) 263\u2013265.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"BF02592210_CR17","doi-asserted-by":"crossref","unstructured":"J. Ji, F. Potra, R. A. Tapia and Y. Zhang, \u201cAn interior-point method with polynomial complexity and superlinear convergence of linear complementarity problems,\u201d Technical report 91-23, Department of Mathematical Sciences, Rice University (1991).","DOI":"10.21236\/ADA452257"},{"key":"BF02592210_CR18","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"BF02592210_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo and S. Mizuno, \u201cA primal-dual infeasible-interior-point algorithm for linear programming,\u201dMathematical Programming 61 (1993) 263\u2013280.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR20","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.16.4.754","volume":"16","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, T. Noma \u201cHomotopy continuation methods for nonlinear complementarity problems,\u201dMathematics of Operations Research 16 (1991) 754\u2013774.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592210_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, T. Noma and A. Yoshise,A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science Vol. 538 (Springer, Berlin, 1991)."},{"key":"BF02592210_CR22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01586054","volume":"54","author":"M. Kojima","year":"1992","unstructured":"M. Kojima, N. Megiddo and Y. Ye, \u201cAn interior point potential reduction algorithm for the linear complementarity problem,\u201dMathematical Programming 54 (1992) 267\u2013279.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR23","first-page":"29","volume-title":"Progress in Mathematical Programming\u2014Interior Point and Related Methods","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, A primal-dual interior-point method for linear programming, in: N. Megiddo, ed.,Progress in Mathematical Programming\u2014Interior Point and Related Methods (Springer, Berlin, 1989) 29\u201347."},{"key":"BF02592210_CR24","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cAn $$O(\\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems,\u201dMathematical Programming 50 (1991) 331\u2013342.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR25","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01581689","volume":"65","author":"M. Kojima","year":"1994","unstructured":"M. Kojima, T. Noma and A. Yoshise, \u201cGlobal convergence in infeasible interior-point algorithms,\u201dMathematical Programming 65 (1994) 43\u201372.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR26","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1080\/02331939208843767","volume":"23","author":"K. O. Kortanek","year":"1992","unstructured":"K. O. Kortanek and H. No, \u201cA second order affine scaling algorithm for the geometric programming dual with logarithmic barrier,\u201dOptimization 23 (1992) 303\u2013322.","journal-title":"Optimization"},{"key":"BF02592210_CR27","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"I. J. Lustig","year":"1990\/1991","unstructured":"I. J. Lustig, \u201cFeasibility issues in a primal-dual interior-point method for linear programming,\u201dMathematical Programming 49 (1990\/1991) 145\u2013162.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR28","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I.J. Lustig","year":"1991","unstructured":"I.J. Lustig, R. Marsten and D. Shanno, \u201cAn implementation of a primal-dual interior point method for linear programming,\u201dLinear Algebra and its Applications 152(1991) 191\u2013222.","journal-title":"Linear Algebra and its Applications"},{"key":"BF02592210_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"I. J. Lustig","year":"1994","unstructured":"I. J. Lustig, R. Marsten and D. Shanno, \u201cInterior point methods for linear programming: Computational state of the art,\u201dORSA Journal on Computing 6 (1994) 1\u201314.","journal-title":"ORSA Journal on Computing"},{"key":"BF02592210_CR30","doi-asserted-by":"crossref","unstructured":"O. L. Mangasarian and J. S. Pang, \u201cThe extended linear complementarity problem,\u201dSIAM Journal on Matrix Analysis and Applications, to appear.","DOI":"10.1137\/S0895479893262734"},{"key":"BF02592210_CR31","first-page":"251","volume-title":"Variational Inequalities and Complementarity Problems","author":"L. McLinden","year":"1980","unstructured":"L. McLinden, \u201cThe complementarity problem for maximal monotone multifunction,\u201d in: R. W. Cottle, F. Giannessi and J. L. Lions, eds.,Variational Inequalities and Complementarity Problems (Wiley, New York, 1980) 251\u2013270."},{"key":"BF02592210_CR32","first-page":"131","volume-title":"Progress in Mathematical Programming\u2014Interior Point and Related Methods","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming\u2014Interior Point and Related Methods, (Springer, Berlin, 1989) 131\u2013158."},{"key":"BF02592210_CR33","unstructured":"S. Mizuno and M.J. Todd, \u201cAn O(n 3 L) long step path following algorithm for a linear complementarity problem,\u201d Technical report No. 23, Department of Industrial Engineering and Management, Tokyo Institute of Technology (1989)."},{"key":"BF02592210_CR34","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01582568","volume":"64","author":"R.D.C. Monteiro","year":"1994","unstructured":"R.D.C. Monteiro, \u201cA globally convergent primal-dual interior point algorithm for convex programming\u201d,Mathematical Programming 64 (1994) 123\u2013147.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR35","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path following primal-dual algorithms. Part I: linear programming,\u201dMathematical Programming 44 (1989) 27\u201341.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR36","doi-asserted-by":"crossref","unstructured":"R. D. C. Monteiro and J. S. Pang, \u201cProperties of an interior point mapping for mixed complementarity problems,\u201dMathematics of Operations Research, to appear.","DOI":"10.1287\/moor.21.3.629"},{"key":"BF02592210_CR37","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/0805007","volume":"5","author":"R. D. C. Monteiro","year":"1995","unstructured":"R. D. C. Monteiro, J. S. Pang and T. Wang, \u201cA positive algorithm for the nonlinear complementarity problem,\u201dSIAM Journal on Optimization 5 (1995) 129\u2013148.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02592210_CR38","unstructured":"R. D. C. Monteiro and T. Tsuchiya, \u201cLimiting behavior of the derivatives of certain trajectory associated with a monotone horizontal linear complementarity problem,\u201d manuscript, Department of Systems and Industrial Engineering, University of Arizona (1992)."},{"key":"BF02592210_CR39","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms","author":"Y. E. Nesterov","year":"1994","unstructured":"Y. E. Nesterov and A. S. Nemirovsky,Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms (SIAM, Philadelphia, PA, 1994)."},{"key":"BF02592210_CR40","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"J. M. Ortega","year":"1970","unstructured":"J. M. Ortega and W. C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, San Diego, CA, 1970)."},{"key":"BF02592210_CR41","doi-asserted-by":"crossref","unstructured":"J. S. Pang, \u201cComplementarity problems,\u201d in: P. Pardalos and R. Horst, eds.,Handbook of Global Optimization (Kluwer, 1995) 271\u2013338.","DOI":"10.1007\/978-1-4615-2025-2_6"},{"key":"BF02592210_CR42","doi-asserted-by":"crossref","unstructured":"F. A. Potra, \u201cAn infeasible interior-point predictor-corrector algorithm for linear programming,\u201dSIAM Journal on Optimization, to appear.","DOI":"10.1137\/0806002"},{"key":"BF02592210_CR43","doi-asserted-by":"crossref","unstructured":"F. A. Potra and Y. Ye, \u201cInterior point methods for nonlinear complementarity problems,\u201dJournal of Optimization Theory and Applications to appear.","DOI":"10.1007\/BF02192201"},{"key":"BF02592210_CR44","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, A polynomial-time algorithm based on Newton's method for linear programming,Mathematical Programming 40 (1988) 59\u201394.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR45","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-1-4615-8285-4_14","volume-title":"Advances in Geometric Programming","author":"M. J. Rijckaert","year":"1980","unstructured":"M. J. Rijckaert and X. M. Martens, \u201cComparison of generalized geometric programming algorithms,\u201d in: M. Avriel, ed.,Advances in Geometric Programming (Plenum, New York, 1980) 283\u2013320."},{"key":"BF02592210_CR46","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R. T. Rockafellar","year":"1970","unstructured":"R. T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970)."},{"key":"BF02592210_CR47","first-page":"866","volume-title":"Lecture Notes in Control and Information Sciences","author":"G. Sonnevend","year":"1985","unstructured":"G. Sonnevend, \u201cAn \u201canalytical centre\u201d for polyhedrons and new class of global algorithms for linear (smooth, convex) programming,\u201d in: Lecture Notes in Control and Information Sciences, Vol. 84 (Springer, New York, 1985) pp. 866\u2013876."},{"key":"BF02592210_CR48","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1287\/ijoc.6.1.28","volume":"6","author":"M. J. Todd","year":"1994","unstructured":"M. J. Todd, \u201cTheory and practice for interior-point methods,\u201dORSA Journal on Computing 6 (1994) 28\u201331.","journal-title":"ORSA Journal on Computing"},{"key":"BF02592210_CR49","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1287\/moor.15.3.508","volume":"15","author":"M. J. Todd","year":"1990","unstructured":"M. J. Todd and Y. Ye, \u201cA centered projective algorithm for linear programming,\u201dMathematics of Operations Research 15 (1990) 508\u2013529.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592210_CR50","volume-title":"On dynamic multi-rigid-body contact problems with Coulomb friction","author":"J. C. Trinkle","year":"1995","unstructured":"J. C. Trinkle, J. S. Pang, S. Sudarsky and G. Lo, \u201cOn dynamic multi-rigid-body contact problems with Coulomb friction,\u201d manuscript. Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD (1995)."},{"key":"BF02592210_CR51","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"R. J. Vanderbei","year":"1995","unstructured":"R. J. Vanderbei, \u201cSymmetric quasidefinite matrices,\u201dSIAM Journal on Optimization 5 (1995) 100\u2013113.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02592210_CR52","unstructured":"J.-P. Vial, \u201cComputational experience with a primal-dual interior-point method for smooth convex programming,\u201d University of Geneva (1992)."},{"key":"BF02592210_CR53","unstructured":"S. Wright, \u201cAn infeasible interior point algorithm for linear complementarity problems,\u201d Technical report MCS-P331-1092, Mathematics and Computer Science Division, Argonne National Laboratory (1992)."},{"key":"BF02592210_CR54","unstructured":"S. Wright and D. Ralph, \u201cA superlinear infeasible interior point algorithm for monotone nonlinear complementarity problems,\u201d Technical report MCS-P344-1292, Mathematics and Computer Science Division, Argonne National Laboratory (1993)."},{"key":"BF02592210_CR55","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, \u201cAn O(n 3 L) potential reduction algorithm for linear programming,\u201dMathematical Programming 50 (1991) 239\u2013258.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR56","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1287\/moor.18.2.334","volume":"18","author":"Y. Ye","year":"1993","unstructured":"Y. Ye, \u201cA fully polynomial-time approximation algorithm for computing a stationary point of the general linear complementarity problem,\u201dMathematics of Operations Research 18 (1993) 334\u2013345.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592210_CR57","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF01585182","volume":"62","author":"Y. Ye","year":"1993","unstructured":"Y. Ye and K. Anstreicher, \u201cOn quadratic and $$O(\\sqrt n L)$$ convergence of a predictor-corrector algorithm for LCP,\u201dMathematical Programming 62 (1993) 537\u2013551.","journal-title":"Mathematical Programming"},{"key":"BF02592210_CR58","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0024-3795(91)90264-W","volume":"152","author":"Y. Ye","year":"1991","unstructured":"Y. Ye and P. Pardalos, \u201cA class of linear complementarity problems solvable in polynomial time,\u201dLinear Algebra and its Applications 152 (1991) 3\u201317.","journal-title":"Linear Algebra and its Applications"},{"key":"BF02592210_CR59","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y. Zhang","year":"1994","unstructured":"Y. Zhang, \u201cOn the convergence of an infeasible interior-point algorithm for linear programming and other problems,\u201dSIAM Journal on Optimization 4 (1994) 208\u2013227.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02592210_CR60","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0803019","volume":"3","author":"Y. Zhang","year":"1993","unstructured":"Y. Zhang, R. Tapia and F. Potra, \u201cOn the superlinear convergence of interior point algorithms for a general class of problems,\u201dSIAM Journal on Optimization 3 (1993) 413\u2013422.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592210.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592210\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:53Z","timestamp":1558395473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["BF02592210"],"URL":"https:\/\/doi.org\/10.1007\/bf02592210","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}