乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T15:51:46Z","timestamp":1723391506120},"reference-count":22,"publisher":"Elsevier BV","issue":"6-7","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"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":2695,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Mathematics with Applications"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1016\/j.camwa.2005.11.033","type":"journal-article","created":{"date-parts":[[2008,4,23]],"date-time":"2008-04-23T04:46:41Z","timestamp":1208926001000},"page":"903-914","source":"Crossref","is-referenced-by-count":36,"title":["A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule"],"prefix":"10.1016","volume":"51","author":[{"given":"Wei","family":"Li","sequence":"first","affiliation":[]},{"given":"P.","family":"Guerrero-Garc\u00eda","sequence":"additional","affiliation":[]},{"given":"A.","family":"Santos-Palomo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.camwa.2005.11.033_bib1","first-page":"155","article-title":"New non-monotone procedures for achieving dual feasibility","volume":"12","author":"Pan","year":"1995","journal-title":"Journal of Nanjing University Mathematical Biquarterly"},{"issue":"1","key":"10.1016\/j.camwa.2005.11.033_bib2","first-page":"167","article-title":"The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study","volume":"101","author":"Pan","year":"1997","journal-title":"Europ. J. Operl. Res."},{"key":"10.1016\/j.camwa.2005.11.033_bib3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0898-1221(98)00024-8","article-title":"A dual projective simplex method for linear programming","volume":"35","author":"Pan","year":"1998","journal-title":"Computers Math. Applic."},{"issue":"3","key":"10.1016\/j.camwa.2005.11.033_bib4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0898-1221(98)00127-8","article-title":"A basis-deficiency-allowing variation of the simplex method for linear programming","volume":"36","author":"Pan","year":"1998","journal-title":"Computers Math. Applic."},{"issue":"10\/11","key":"10.1016\/j.camwa.2005.11.033_bib5","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1016\/S0898-1221(01)00254-1","article-title":"A Phase-1 approach for the generalized simplex algorithm","volume":"42","author":"Pan","year":"2001","journal-title":"Computers Math. Applic."},{"issue":"3","key":"10.1016\/j.camwa.2005.11.033_bib6","first-page":"88","article-title":"A Phase-I algorithm using the most-obtuse-angle rule for the basis-deficiency-allowing dual simplex method","volume":"8","author":"Pan","year":"2004","journal-title":"OR Transactions"},{"issue":"3","key":"10.1016\/j.camwa.2005.11.033_bib7","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/S0377-2217(03)00276-5","article-title":"The sagitta method for solving linear programs","volume":"157","author":"Santos-Palomo","year":"2004","journal-title":"Europ. J. Operl. Res."},{"key":"10.1016\/j.camwa.2005.11.033_bib8","article-title":"Range-Space Methods for Sparse Linear Programs","author":"Guerrero-Garcia","year":"2000"},{"key":"10.1016\/j.camwa.2005.11.033_bib9","article-title":"Optimization Toolbox v2.1 for use with MATLAB, user's guide","author":"Coleman","year":"1999"},{"key":"10.1016\/j.camwa.2005.11.033_bib10","series-title":"Technical Report","article-title":"The TOMLAB optimization environment v3.0 user's guide","author":"Holmstr\u03a9","year":"2001"},{"issue":"1","key":"10.1016\/j.camwa.2005.11.033_bib11","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.ejor.2003.06.048","article-title":"Phase-I cycling under the most-obtuse-angle pivot rule","volume":"167","author":"Guerrero-Garc\u00eda","year":"2005","journal-title":"Europ. J. Operl. Res."},{"key":"10.1016\/j.camwa.2005.11.033_bib12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01721801","article-title":"Practical finite pivoting rules for the simplex method","volume":"12","author":"Pan","year":"1990","journal-title":"OR Spektrum"},{"key":"10.1016\/j.camwa.2005.11.033_bib13","series-title":"Proceedings of the 20th Biennial Conference on Numerical Analysis","first-page":"19","article-title":"Palomo A non-simplex active-set framework for basis-deficiency-allowing simplex variations","author":"Guerrero-Garc\u00eda","year":"2003"},{"key":"10.1016\/j.camwa.2005.11.033_bib14","series-title":"Technical Report","article-title":"Sagitta method with guaranteed convergence","author":"Santos-Palomo","year":"2005"},{"key":"10.1016\/j.camwa.2005.11.033_bib15","series-title":"Numerical Methods for Least Squares Problems","author":"Bjck","year":"1996"},{"key":"10.1016\/j.camwa.2005.11.033_bib16","series-title":"Technical Report","article-title":"Computational experiences with dense and sparse implementations of the sagitta method","author":"Santos-Palomo","year":"2005"},{"key":"10.1016\/j.camwa.2005.11.033_bib17","first-page":"10","article-title":"Electronic mail distribution of linear programming test problems","volume":"13","author":"Gay","year":"1985","journal-title":"Committee on Algorithms (COAL) Newsletter"},{"key":"10.1016\/j.camwa.2005.11.033_bib18","series-title":"Technical Report","article-title":"A comparison of three sparse linear program solvers","author":"Guerrero-Garc\u00eda","year":"2003"},{"key":"10.1016\/j.camwa.2005.11.033_bib19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01403888","article-title":"A direct method for sparse least squares problems with lower and upper bounds","volume":"54","author":"Bjck","year":"1988","journal-title":"Numer. Math."},{"key":"10.1016\/j.camwa.2005.11.033_bib20","series-title":"Licentiat thesis","article-title":"A Direct Method for Sparse Nonnegative Least Squares Problems","author":"Oreborn","year":"1986"},{"key":"10.1016\/j.camwa.2005.11.033_bib21","article-title":"Solving a sequence of sparse least squares problems","author":"Santos-Palomo","year":"2001"},{"key":"10.1016\/j.camwa.2005.11.033_bib22","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF01589112","article-title":"A direct active set algorithm for large sparse quadratic programs with simple lower bounds","volume":"45","author":"Coleman","year":"1989","journal-title":"Math. Progr."}],"container-title":["Computers & Mathematics with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0898122106000460?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0898122106000460?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,29]],"date-time":"2018-12-29T11:24:30Z","timestamp":1546082670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0898122106000460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3]]},"references-count":22,"journal-issue":{"issue":"6-7","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["S0898122106000460"],"URL":"https:\/\/doi.org\/10.1016\/j.camwa.2005.11.033","relation":{},"ISSN":["0898-1221"],"issn-type":[{"value":"0898-1221","type":"print"}],"subject":[],"published":{"date-parts":[[2006,3]]}}}