{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:32:44Z","timestamp":1649133164951},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Automat Comput"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s11633-007-0088-2","type":"journal-article","created":{"date-parts":[[2007,2,2]],"date-time":"2007-02-02T18:03:01Z","timestamp":1170439381000},"page":"88-94","source":"Crossref","is-referenced-by-count":2,"title":["A fast LDL-factorization approach for large sparse positive definite system and its application to one-to-one marketing optimization computation"],"prefix":"10.1007","volume":"4","author":[{"given":"Min","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bei","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Hua","family":"She","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"88_CR1","volume-title":"Building Data Mining Applications for CRM","author":"A. Berson","year":"1999","unstructured":"A. Berson, S. Smith, K. Thearling. Building Data Mining Applications for CRM, McGraw-Hill Press, New York, 1999."},{"issue":"11","key":"88_CR2","first-page":"40","volume":"45","author":"K. Lange","year":"2003","unstructured":"Lange, Kirsten. The Benefits of Crm. Pulp and Paper International, vol. 45, no. 11, pp. 40\u201342, 2003.","journal-title":"Pulp and Paper International"},{"issue":"19","key":"88_CR3","first-page":"32","volume":"246","author":"M. Tim","year":"2005","unstructured":"M. Tim. Crm Goes Small to Get Big Again. Telephony, vol. 246, no. 19, pp. 32\u201335, 2005.","journal-title":"Telephony"},{"issue":"19","key":"88_CR4","first-page":"45","volume":"40","author":"M. Wu","year":"2004","unstructured":"M. Wu, B. He, S. Chen. A Benchmark Method for One-to-one Marketing Optimization Algorithms. Computer Engineering and Applications, vol. 40, no. 19, pp. 45\u201347, 2004. (in Chinese)","journal-title":"Computer Engineering and Applications"},{"key":"88_CR5","volume-title":"Interior Point Methods for Large-scale Linear Programming, Technical Report","author":"E. John","year":"2004","unstructured":"E. John, Mitchell, K. Farwell, D. Ramsden. Interior Point Methods for Large-scale Linear Programming, Technical Report, Mathematical Sciences Rensselaer Polytechnic Institute, Troy, NY, 2004."},{"key":"88_CR6","volume-title":"Building an Old-fashioned Sparse Solver, Technical Report","author":"G. W. Stewart","year":"2003","unstructured":"G. W. Stewart. Building an Old-fashioned Sparse Solver, Technical Report, University of Maryland, USA, 2003."},{"key":"88_CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/B978-1-4832-3187-7.50018-0","volume-title":"Graph Theory and Computing","author":"D. J. Rose","year":"1972","unstructured":"D. J. Rose. A Graph-theoretic Study of the Numerical Solution of Sparse Positive Definite System of Linear Equation. Graph Theory and Computing, Academic Press, New York, pp. 183\u2013217, 1972."},{"key":"88_CR8","volume-title":"Computer Solution of Large Sparse Positive Definite System","author":"A. George","year":"1981","unstructured":"A. George, J. K. Reid. Computer Solution of Large Sparse Positive Definite System, Prentice-Hall, Englewood Cliffs, NJ, 1981."},{"key":"88_CR9","doi-asserted-by":"crossref","unstructured":"J. W. H. Liu. A Generalized Envelope Method for Sparse Factorization by Rows. ACM Transations on Mathematical Software, vol. 17, no. 1, 1991.","DOI":"10.1145\/103147.103159"},{"issue":"5","key":"88_CR10","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0909058","volume":"9","author":"J. R. Gilbert","year":"1988","unstructured":"J. R. Gilbert, T. Peierls. Sparse Partial Pivoting in Time Proportional to Arithmetic Operations. SIAM Journal on Scientific and Statistical Computing, vol. 9, no. 5, pp. 862\u2013874, 1988.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"88_CR11","volume-title":"User Guide for LDL, a Concise Sparse Cholesky Package, Technical Report","author":"T. A. Davis","year":"2005","unstructured":"T. A. Davis. User Guide for LDL, a Concise Sparse Cholesky Package, Technical Report, Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, USA, 2005."},{"issue":"3","key":"88_CR12","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P. R. Amestoy","year":"1996","unstructured":"P. R. Amestoy, T. Davis, I. Du. An Approximate Minimum Degree Ordering Algorithm, SIAM Journal on Matrix Analysis and Applications, vol. 17, no. 3, pp. 886\u2013905, 1996.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"4","key":"88_CR13","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1137\/S0895479801385037","volume":"23","author":"I. Brainman","year":"2001","unstructured":"I. Brainman, S. Toledo. Nested-dissection Orderings for Sparse Lu with Partial Pivoting. SIAM Journal on Matrix Analysis and Applications, vol. 23, no. 4, pp. 998\u20131012, 2001.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"88_CR14","volume-title":"Numerical Analysis","year":"2004","unstructured":"Q. Li, N. Wang, D. Yi, Eds., Numerical Analysis, 4th ed., Qinghua University Press, Beijing, China, 2004. (in Chinese)","edition":"4th ed."},{"issue":"1","key":"88_CR15","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1137\/S0895479887139455","volume":"15","author":"J. R. Gilbert","year":"1994","unstructured":"J. R. Gilbert. Predicting Structure in Sparse Matrix Computations. SIAM Journal on Matrix Analysis and Applications, vol. 15, no. 1, pp. 62\u201379, 1994.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"1","key":"88_CR16","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J. W. H. Liu","year":"1990","unstructured":"J. W. H. Liu. The Role of Elimination Trees in Sparse Factorization. SIAM Journal on Matrix Analysis and Applications, vol. 11, no. 1, pp. 134\u2013172, 1990.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"4","key":"88_CR17","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1002\/nme.1620180804","volume":"18","author":"S. C. Eisenstat","year":"1982","unstructured":"S. C. Eisenstat, M. C. Gursky, M. H. Schultz, A. H. Sherman. Yale Sparse Matrix Package I: the Symmetric Codes. International Journal for Numerical Methods in Engineering, vol. 18, no. 4, pp. 1145\u20131151, 1982.","journal-title":"International Journal for Numerical Methods in Engineering"},{"issue":"3","key":"88_CR18","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/1024074.1024081","volume":"30","author":"P. R. Amestoy","year":"2004","unstructured":"P. R. Amestoy, T. A. Davis, I. S. Du. Algorithm 837: Amd, an Approximate Minimum Degree Ordering Algorithm. ACM Transactions on Mathematical Software, vol. 30, no. 3, pp. 381\u2013388, 2004.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"88_CR19","first-page":"451","volume-title":"Proceedings of 23rd Chinese Control Conference","author":"B. He","year":"2004","unstructured":"B. He, M. Wu, H. Mitsuma, Y. C. Zhou. An One to One Marketing Optimization Algorithm Based on Minimum Degree Permutation. In Proceedings of 23rd Chinese Control Conference, X. W. Daizhang Cheng, Ed., East China University of Science and Technology Press, Shanghai, pp. 451\u2013453, 2004. (in Chinese)"},{"key":"88_CR20","volume-title":"Single Objective, Multiple Objective and Integer Programming","author":"K. D. Lu","year":"1999","unstructured":"K. D. Lu. Single Objective, Multiple Objective and Integer Programming, Tsinghua University Press, Beijing, 1999. (in Chinese)"},{"issue":"1","key":"88_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10556789808805699","volume":"10","author":"Y. Zhang","year":"1998","unstructured":"Y. Zhang. Solving Large-scale Linear Programs by Interior-point Methods Under the Matlab Environment. Optimization Methods and Software, vol. 10, no. 1, pp. 1\u201331, 1998.","journal-title":"Optimization Methods and Software"}],"container-title":["International Journal of Automation and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-007-0088-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11633-007-0088-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11633-007-0088-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T18:46:33Z","timestamp":1559414793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11633-007-0088-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["88"],"URL":"https:\/\/doi.org\/10.1007\/s11633-007-0088-2","relation":{},"ISSN":["1476-8186","1751-8520"],"issn-type":[{"value":"1476-8186","type":"print"},{"value":"1751-8520","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}