{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:41:19Z","timestamp":1759848079498},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,12,20]],"date-time":"2007-12-20T00:00:00Z","timestamp":1198108800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10589-007-9157-2","type":"journal-article","created":{"date-parts":[[2007,12,19]],"date-time":"2007-12-19T11:42:42Z","timestamp":1198064562000},"page":"213-247","source":"Crossref","is-referenced-by-count":7,"title":["A stable primal\u2013dual approach for linear programming under nondegeneracy assumptions"],"prefix":"10.1007","volume":"44","author":[{"given":"Maria","family":"Gonzalez-Lima","sequence":"first","affiliation":[]},{"given":"Hua","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Henry","family":"Wolkowicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,12,20]]},"reference":[{"key":"9157_CR1","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1287\/mnsc.42.12.1719","volume":"42","author":"E.D. Andersen","year":"1996","unstructured":"Andersen, E.D., Ye, Y.: Combining interior-point and pivoting algorithms for linear programming. Manag. Sci. 42, 1719\u20131731 (1996)","journal-title":"Manag. Sci."},{"issue":"4","key":"9157_CR2","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1137\/S1052623497323194","volume":"9","author":"K.M. Anstreichner","year":"1999","unstructured":"Anstreichner, K.M.: Linear programming in O((n 3\/ln\u2009n)L) operations. SIAM J. Optim. 9(4), 803\u2013812 (1999) (electronic). Dedicated to John E. Dennis, Jr., on his 60th birthday","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9157_CR3","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A. Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.S.: Robust convex optimization. Math. Oper. Res. 23(4), 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9157_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A. Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.S.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9157_CR5","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A. Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. Ser. A 88(3), 411\u2013424 (2000)","journal-title":"Math. Program. Ser. A"},{"issue":"5","key":"9157_CR6","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1137\/S1064827594271421","volume":"17","author":"M. Benzi","year":"1996","unstructured":"Benzi, M., Meyer, C.D., Tu\u0307ma, M.: A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput. 17(5), 1135\u20131149 (1996)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"9157_CR7","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/S1064827595294691","volume":"19","author":"M. Benzi","year":"1998","unstructured":"Benzi, M., Tu\u0307ma, M.: A sparse approximate inverse preconditioner for nonsymmetric linear systems. SIAM J. Sci. Comput. 19(3), 968\u2013994 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"9157_CR8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/B:COAP.0000026882.34332.1b","volume":"28","author":"L. Bergamaschi","year":"2004","unstructured":"Bergamaschi, L., Gondzio, J., Zilli, G.: Preconditioning indefinite systems in interior point methods for optimization. Comput. Optim. Appl. 28(2), 149\u2013171 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"9157_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/B978-0-12-141050-6.50015-5","volume-title":"Sparse Matrix Computations","author":"\u00c5. Bj\u00f6rck","year":"1976","unstructured":"Bj\u00f6rck, \u00c5.: Methods for sparse least squares problems. In: Bunch, J.R., Rose, D.J. (eds.) Sparse Matrix Computations, pp.\u00a0177\u2013199. Academic Press, New York (1976)"},{"issue":"4","key":"9157_CR10","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1137\/0727064","volume":"27","author":"J. Burke","year":"1990","unstructured":"Burke, J.: On the identification of active constraints II. The nonconvex case. SIAM J. Numer. Anal. 27(4), 1081\u20131103 (1990)","journal-title":"SIAM J. Numer. Anal."},{"issue":"5","key":"9157_CR11","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1137\/0725068","volume":"25","author":"J.V. Burke","year":"1988","unstructured":"Burke, J.V., Mor\u00e9, J.J.: On the identification of active constraints. SIAM J. Numer. Anal. 25(5), 1197\u20131211 (1988)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"9157_CR12","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1137\/0804032","volume":"4","author":"J.V. Burke","year":"1994","unstructured":"Burke, J.V., Mor\u00e9, J.J.: Exposing constraints. SIAM J. Optim. 4(3), 573\u2013595 (1994)","journal-title":"SIAM J. Optim."},{"issue":"2\/3","key":"9157_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10589-006-9006-8","volume":"36","author":"J.-S. Chai","year":"2007","unstructured":"Chai, J.-S., Toh, K.-C.: Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming. Comput. Optim. Appl. 36(2\/3), 221\u2013247 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"9157_CR14","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-642-46631-1_11","volume-title":"Optimization, Parallel Processing and Applications","author":"R. Leone De","year":"1988","unstructured":"De Leone, R., Mangasarian, O.L.: Serial and parallel solution of large scale linear programs by augmented Lagrangian successive overrelaxation. In: Optimization, Parallel Processing and Applications, Oberwolfach, Karlsruhe, 1987. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0304, pp.\u00a0103\u2013124. Springer, Berlin (1988)"},{"key":"9157_CR15","series-title":"Classics in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971200","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis Jr.","year":"1996","unstructured":"Dennis, J.E. Jr., Schnabel, B.R.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Classics in Applied Mathematics, vol.\u00a016. SIAM, Philadelphia (1996) (Corrected reprint of the 1983 original)"},{"issue":"5","key":"9157_CR16","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1137\/0730067","volume":"30","author":"J.E. Dennis Jr.","year":"1993","unstructured":"Dennis, J.E. Jr., Wolkowicz, H.: Sizing and least-change secant methods. SIAM J. Numer. Anal. 30(5), 1291\u20131314 (1993)","journal-title":"SIAM J. Numer. Anal."},{"key":"9157_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11075-006-9019-5","volume":"105","author":"J. Dominguez","year":"2006","unstructured":"Dominguez, J., Gonzalez-Lima, M.D.: A primal\u2013dual interior-point algorithm for quadratic programming. Numer. Algorithms 105, 1\u201330 (2006)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"9157_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1137\/1036003","volume":"36","author":"A.S. El-Bakry","year":"1994","unstructured":"El-Bakry, A.S., Tapia, R.A., Zhang, Y.: A study of indicators for identifying zero variables in interior-point methods. SIAM Rev. 36(1), 45\u201372 (1994)","journal-title":"SIAM Rev."},{"key":"9157_CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971316","volume-title":"Nonlinear Programming Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1990","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming Sequential Unconstrained Minimization Techniques. SIAM, Philadelphia (1990)"},{"key":"9157_CR20","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1137\/0914009","volume":"14","author":"R.W. Freund","year":"1993","unstructured":"Freund, R.W., Gutknecht, M.H., Nachtigal, N.M.: An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices. SIAM J. Sci. Comput. 14, 137\u2013158 (1993)","journal-title":"SIAM J. Sci. Comput."},{"key":"9157_CR21","first-page":"183","volume":"76","author":"R.W. Freund","year":"1996","unstructured":"Freund, R.W., Jarre, F.: A QMR-based interior-point algorithm for solving linear programs. Math. Program. Ser. B 76, 183\u2013210 (1996)","journal-title":"Math. Program. Ser. B"},{"key":"9157_CR22","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0710036","volume":"10","author":"G.H. Golub","year":"1973","unstructured":"Golub, G.H., Pereyra, V.: The differentiation of pseudoinverses and nonlinear least squares problems whose variables separate. SIAM J. Numer. Anal. 10, 413\u2013432 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"9157_CR23","unstructured":"Gould, N.I.M., Orban, D., Sartenaer, A., Toint, Ph.L.: Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. Tr\/pa\/00\/56, CERFACS, Toulouse, France (2001)"},{"key":"9157_CR24","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970937","volume-title":"Iterative Methods for Solving Linear Systems","author":"A. Greenbaum","year":"1997","unstructured":"Greenbaum, A.: Iterative Methods for Solving Linear Systems. SIAM, Philadelphia (1997)"},{"issue":"1\u20134","key":"9157_CR25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02096259","volume":"46\/47","author":"O. G\u00fcler","year":"1993","unstructured":"G\u00fcler, O., Den Hertog, D., Roos, C., Terlaky, T., Tsuchiya, T.: Degeneracy in interior point methods for linear programming: a survey (Degeneracy in Optimization Problems). Ann. Oper. Res. 46\/47(1\u20134), 107\u2013138 (1993)","journal-title":"Ann. Oper. Res."},{"key":"9157_CR26","series-title":"Fields Institute Communications","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1090\/fic\/037\/06","volume-title":"Novel Approaches to Hard Discrete Optimization","author":"W.W. Hager","year":"2003","unstructured":"Hager, W.W.: The dual active set algorithm and the iterative solution of linear programs. In: Novel Approaches to Hard Discrete Optimization, Waterloo, ON, 2001. Fields Institute Communications, vol.\u00a037, pp.\u00a097\u2013109. Am. Math. Soc., Providence (2003)"},{"issue":"1","key":"9157_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1021882330897","volume":"24","author":"J.J. J\u00fadice","year":"2003","unstructured":"J\u00fadice, J.J., Patricio, J., Portugal, L.F., Resende, M.G.C., Veiga, G.: A study of preconditioners for network interior point methods. Comput. Optim. Appl. 24(1), 5\u201335 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"9157_CR28","first-page":"89","volume":"3","author":"L.V. Kantorovich","year":"1948","unstructured":"Kantorovich, L.V.: Functional analysis and applied mathematics. Uspekhi Mat. Nauk 3, 89\u2013185 (1948) (Transl. by C. Benster as N.B.S. Rept. 1509, Washington, 1952)","journal-title":"Uspekhi Mat. Nauk"},{"issue":"4","key":"9157_CR29","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s11155-006-9004-7","volume":"12","author":"C. Keil","year":"2006","unstructured":"Keil, C., Jansson, C.: Computational experience with rigorous error bounds for the Netlib linear programming library. Reliab. Comput. 12(4), 303\u2013321 (2006)","journal-title":"Reliab. Comput."},{"issue":"3","key":"9157_CR30","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/S0895479893259509","volume":"17","author":"S. Lu","year":"1996","unstructured":"Lu, S., Barlow, J.L.: Multifrontal computation with the orthogonal factors of sparse matrices. SIAM J. Matrix Anal. Appl. 17(3), 658\u2013679 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"9157_CR31","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0718039","volume":"18","author":"O.L. Mangasarian","year":"1981","unstructured":"Mangasarian, O.L.: Iterative solution of linear programs. SIAM J. Numer. Anal. 18(4), 606\u2013614 (1981)","journal-title":"SIAM J. Numer. Anal."},{"key":"9157_CR32","unstructured":"Matstoms, P.: The multifrontal solution of sparse linear least squares problems. Licentiat thesis, Department of Mathematics, Link\u00f6ping University, Sweden (1991)"},{"key":"9157_CR33","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/174603.174408","volume":"20","author":"P. Matstoms","year":"1994","unstructured":"Matstoms, P.: Sparse QR factorization in MATLAB. ACM Trans. Math. Softw. 20, 136\u2013159 (1994)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"9157_CR34","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/ijoc.4.2.103","volume":"4","author":"S. Mehrotra","year":"1992","unstructured":"Mehrotra, S.: Implementations of affine scaling methods: approximate solutions of systems of linear equations using preconditioned conjugate gradient methods. ORSA J. Comput. 4(2), 103\u2013118 (1992)","journal-title":"ORSA J. Comput."},{"key":"9157_CR35","first-page":"124","volume-title":"Linear and Nonlinear Conjugate Gradient-Related Methods","author":"S. Mehrotra","year":"1996","unstructured":"Mehrotra, S., Wang, J.-S.: Conjugate gradient based implementation of interior point methods for network flow problems. In: Linear and Nonlinear Conjugate Gradient-Related Methods, Seattle, WA, 1995, pp.\u00a0124\u2013142. SIAM, Philadelphia (1996)"},{"issue":"3","key":"9157_CR36","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF01585180","volume":"62","author":"S. Mehrotra","year":"1993","unstructured":"Mehrotra, S., Ye, Y.: Finding an interior point in the optimal face of linear programs. Math. Program. A 62(3), 497\u2013515 (1993)","journal-title":"Math. Program. A"},{"key":"9157_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.laa.2004.08.019","volume":"394","author":"A.R.L. Oliveira","year":"2005","unstructured":"Oliveira, A.R.L., Sorensen, D.C.: A new class of preconditioners for large-scale linear systems from interior point methods for linear programming. Linear Algebra Appl. 394, 1\u201324 (2005)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"9157_CR38","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1137\/S1052623402401804","volume":"14","author":"F. Ord\u00f3\u00f1ez","year":"2003","unstructured":"Ord\u00f3\u00f1ez, F., Freund, R.M.: Computational experience and the explanatory value of condition measures for linear optimization. SIAM J. Optim. 14(2), 307\u2013333 (2003) (electronic)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9157_CR39","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"C.C. Paige","year":"1982","unstructured":"Paige, C.C., Saunders, M.A.: LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8(1), 43\u201371 (1982)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1\u20133","key":"9157_CR40","first-page":"299","volume":"79","author":"J. Pang","year":"1997","unstructured":"Pang, J.: Error bounds in mathematical programming (Lectures on Mathematical Programming (ISMP97), Lausanne, 1997). Math. Program. Ser. B 79(1\u20133), 299\u2013332 (1997)","journal-title":"Math. Program. Ser. B"},{"key":"9157_CR41","unstructured":"Perez-Garzia, S.: Alternative iterative primal\u2013dual interior-point algorithms for linear programming. Master\u2019s thesis, Simon Bolivar University, Center for Statistics and Mathematical Software (CESMa), Venezuela (2003)"},{"key":"9157_CR42","unstructured":"Perez-Garcia, S., Gonzalez-Lima, M.: On a non-inverse approach for solving the linear systems arising in primal\u2013dual interior point methods for linear programming. Technical report 2004-01, Simon Bolivar University, Center for Statistical and Mathematical Software, Caracas, Venezuela (2004)"},{"key":"9157_CR43","volume-title":"Solutions of Ill-Posed Problems","author":"A.N. Tikhonov","year":"1977","unstructured":"Tikhonov, A.N., Arsenin, V.Y.: Solutions of Ill-Posed Problems. Winston\/Wiley, Washington (1977) (Transl. ed. Fritz John)"},{"key":"9157_CR44","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF02165096","volume":"14","author":"A. Sluis Van der","year":"1969","unstructured":"Van der Sluis, A.: Condition numbers and equilibration of matrices. Numer. Math. 14, 14\u201323, (1969\/1970)","journal-title":"Numer. Math."},{"key":"9157_CR45","volume-title":"Linear Programming: Foundations and Extensions","author":"R.J. Vanderbei","year":"1998","unstructured":"Vanderbei, R.J.: Linear Programming: Foundations and Extensions. Kluwer Academic, Dordrecht (1998)"},{"issue":"1\u20134","key":"9157_CR46","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/10556789908805759","volume":"11\/12","author":"R.J. Vanderbei","year":"1999","unstructured":"Vanderbei, R.J.: LOQO: an interior point code for quadratic programming (Interior Point Methods). Optim. Methods Softw. 11\/12(1\u20134), 451\u2013484 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9157_CR47","unstructured":"Wei, H.: Numerical stability in linear programming and semidefinite programming. Ph.D. thesis, University of Waterloo (2006)"},{"issue":"6","key":"9157_CR48","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1080\/1055678042000193162","volume":"19","author":"H. Wolkowicz","year":"2004","unstructured":"Wolkowicz, H.: Solving semidefinite programs using preconditioned conjugate gradients. Optim. Methods Softw. 19(6), 653\u2013672 (2004)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9157_CR49","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/S1052623497322279","volume":"9","author":"M.H. Wright","year":"1999","unstructured":"Wright, M.H.: Ill-conditioning and computational error in interior methods for nonlinear programming. SIAM J. Optim. 9(1), 84\u2013111 (1999) (electronic)","journal-title":"SIAM J. Optim."},{"key":"9157_CR50","volume-title":"Primal\u2013Dual Interior-Point Methods","author":"S. Wright","year":"1996","unstructured":"Wright, S.: Primal\u2013Dual Interior-Point Methods. SIAM, Philadelphia (1996)"},{"key":"9157_CR51","unstructured":"Wright, S.: Modifying SQP for degenerate problems. Technical report, Argonne National Laboratory (1997)"},{"issue":"4","key":"9157_CR52","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1137\/S0895479893260498","volume":"16","author":"S.J. Wright","year":"1995","unstructured":"Wright, S.J.: Stability of linear equations solvers in interior-point methods. SIAM J. Matrix Anal. Appl. 16(4), 1287\u20131307 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"9157_CR53","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/S0895479894271093","volume":"18","author":"S.J. Wright","year":"1997","unstructured":"Wright, S.J.: Stability of augmented system factorizations in interior-point methods. SIAM J. Matrix Anal. Appl. 18(1), 191\u2013222 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1\u20134","key":"9157_CR54","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1080\/10556789908805756","volume":"11\/12","author":"Y. Zhang","year":"1999","unstructured":"Zhang, Y.: User\u2019s guide to LIPSOL: linear-programming interior point solvers V0.4 (Interior Point Methods). Optim. Methods Softw. 11\/12(1\u20134), 385\u2013396 (1999)","journal-title":"Optim. Methods Softw."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9157-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9157-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9157-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:34Z","timestamp":1559288194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9157-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,20]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9157"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9157-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,20]]}}}