{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T09:48:00Z","timestamp":1722073680182},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf01299543","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T09:56:56Z","timestamp":1111744616000},"page":"299-316","source":"Crossref","is-referenced-by-count":3,"title":["The ellipsoid algorithm using parallel cuts"],"prefix":"10.1007","volume":"2","author":[{"given":"Aiping","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Todd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Nonlinear Programming: Analysis and Methods","author":"M. Avriel","year":"1976","unstructured":"M. Avriel,Nonlinear Programming: Analysis and Methods, Prentice-Hall, Inc: Englewood Cliffs, NJ, 1976."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1287\/moor.10.4.688","volume":"10","author":"B.P. Burrell","year":"1985","unstructured":"B.P. Burrell and M.J. Todd, ?The ellipsoid method generates dual variables,?Math. Oper. Res. vol. 10, pp. 688?700, 1985.","journal-title":"Math. Oper. Res."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120921","volume":"14","author":"P. G\u00e1cs","year":"1981","unstructured":"P. G\u00e1cs and L. Lov\u00e1sz, ?Khachiyan's algorithm for linear programming,?Math. Prog. Study, vol. 14, pp. 61?68, 1981.","journal-title":"Math. Prog. Study"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver, ?The ellipsoid method and its consequences in combinatorial optimization,?Combinatorica, vol. 1, pp. 169?197, 1981.","journal-title":"Combinatorica"},{"key":"CR5","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1990","unstructured":"R.A. Horn and C.R. Johnson,Matrix Analysis, Cambridge University Press: Cambridge, England, 1990."},{"key":"CR6","volume-title":"The Theory of Matrices in Numerical Analysis","author":"A.S. Householder","year":"1964","unstructured":"A.S. Householder,The Theory of Matrices in Numerical Analysis, Ginn (Blaisdell): Boston, MA, 1964."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","volume":"20","author":"L.G. Khachian","year":"1980","unstructured":"L.G. Khachian, ?Polynomial algorithms for linear programming,?USSR Comput. Math. Math. Phys. vol. 20, pp. 53?72, 1980.","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"CR8","volume-title":"Algorithms for Linear Programming via Weighted Centers","author":"A. Liao","year":"1992","unstructured":"A. Liao, ?Algorithms for Linear Programming via Weighted Centers,? PhD thesis, Cornell University, Ithaca, NY, 1992."},{"key":"CR9","series-title":"Technical Report CTC93TR-145","volume-title":"Solving LP Problems via Weighted Centers","author":"A. Liao","year":"1993","unstructured":"A. Liao and M.J. Todd, ?Solving LP Problems via Weighted Centers,? Technical Report CTC93TR-145, Advanced Computing Research Institute, Cornell University, Ithaca, NY, 1993."},{"key":"CR10","volume-title":"Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms","author":"Y.E. Nesterov","year":"1993","unstructured":"Y.E. Nesterov and A.S. Nemirovsky,Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms, SIAM Publications: Philadelphia, PA, 1993."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/moor.7.2.253","volume":"7","author":"M.J. Todd","year":"1980","unstructured":"M.J. Todd, ?On minimum volume ellipsoids containing part of a given ellipsoid,?Math. Oper. Res., vol. 7, pp. 253?261, 1980.","journal-title":"Math. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299543.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299543\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299543","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:08:07Z","timestamp":1556647687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299543"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF01299543"],"URL":"https:\/\/doi.org\/10.1007\/bf01299543","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}