{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:26:17Z","timestamp":1725575177605},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258636"},{"type":"electronic","value":"9783540323099"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424925_52","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T11:14:27Z","timestamp":1295090067000},"page":"488-498","source":"Crossref","is-referenced-by-count":0,"title":["A First-Order \u03b5-Approximation Algorithm for Linear Programs and a Second-Order Implementation"],"prefix":"10.1007","author":[{"given":"Ana Maria A. C.","family":"Rocha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edite M. G. P.","family":"Fernandes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00e3o L. C.","family":"Soares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: Producing primal solutions with a subgradient method. Math. Prog.\u00a087, 385\u2013399 (2000)","journal-title":"Math. Prog."},{"key":"52_CR2","volume-title":"Potential Function Methods for approximately solving linear programming problems: theory and practice","author":"D. Bienstock","year":"2002","unstructured":"Bienstock, D.: Potential Function Methods for approximately solving linear programming problems: theory and practice. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"52_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1137\/0804004","volume":"4","author":"M.D. Grigoriadis","year":"1994","unstructured":"Grigoriadis, M.D., Khachiyan, L.G.: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim.\u00a04, 86\u2013107 (1994)","journal-title":"SIAM J. Optim."},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Karger, D., Plotkin, S.: Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 18\u201325 (1995)","DOI":"10.1145\/225058.225073"},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S. Plotkin","year":"1995","unstructured":"Plotkin, S., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res.\u00a020, 495\u2013504 (1995)","journal-title":"Math. Oper. Res."},{"key":"52_CR6","unstructured":"Rocha, A.M.: Fast and stable algorithms based on the Lagrangian relaxation. PhD Thesis (in portuguese), Universidade do Minho, Portugal (2004) (forthcoming)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424925_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:37:38Z","timestamp":1558294658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424925_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258636","9783540323099"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11424925_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}