{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T19:54:22Z","timestamp":1767902062073,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1023\/a:1018318117350","type":"journal-article","created":{"date-parts":[[2003,2,6]],"date-time":"2003-02-06T17:08:17Z","timestamp":1044551297000},"page":"37-52","source":"Crossref","is-referenced-by-count":30,"title":["On Improvements to the Analytic Center Cutting Plane Method"],"prefix":"10.1007","volume":"11","author":[{"given":"O.","family":"du Merle","sequence":"first","affiliation":[]},{"given":"J.-L.","family":"Goffin","sequence":"additional","affiliation":[]},{"given":"J.-P.","family":"Vial","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"168456_CR1","volume-title":"LAPACK Users\u2019 Guide","author":"E. Anderson","year":"1992","unstructured":"E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov and D. Sorensen, LAPACK Users\u2019 Guide, SIAM, Philadelphia, 1992."},{"key":"168456_CR2","doi-asserted-by":"crossref","unstructured":"D. S. Atkinson and P. M. Vaidya, \u201cA cutting plane algorithm that uses analytic centers,\u201d Nondifferentiable and Large Scale Optimization, Mathematical Programming, Series B, J. L. Goffin and J. P. Vial, eds, vol. 69, pp. 1\u201343, 1995.","DOI":"10.1007\/BF01585551"},{"key":"168456_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0166-218X(94)90198-8","volume":"49","author":"O. Bahn","year":"1994","unstructured":"O. Bahn, J.-L. Goffin, J.-P. Vial and O. du Merle, \u201cExperimental behaviour of an interior point cutting plane algorithm for convex programming: An application to geometric programming,\u201d Discrete Applied Mathematics, vol. 49, pp. 3\u201323, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"168456_CR4","doi-asserted-by":"crossref","unstructured":"O. Bahn, O. du Merle, J.-L. Goffin and J.-P. Vial, \u201cAcutting plane method from analytic centers for stochastic programming,\u201d Nondifferentiable and Large Scale Optimization, Mathematical Programming, Series B, J. L. Goffin and J. P. Vial, eds, vol. 69, pp. 45\u201373, 1995.","DOI":"10.1007\/BF01585552"},{"key":"168456_CR5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"J. F. Benders, \u201cPartitioning procedures for solving mixed-variables programming problems,\u201d Numerische Mathematik, vol. 4, pp. 238\u2013252, 1962.","journal-title":"Numerische Mathematik"},{"key":"168456_CR6","doi-asserted-by":"crossref","first-page":"767","DOI":"10.2307\/1911818","volume":"29","author":"G. B. Dantzig","year":"1961","unstructured":"G. B. Dantzig and P. Wolfe, \u201cThe decomposition algorithm for linear programming,\u201d Econometrica, vol. 29, pp. 767\u2013778, 1961.","journal-title":"Econometrica"},{"key":"168456_CR7","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01840456","volume":"1","author":"G. de Ghellinck","year":"1986","unstructured":"G. de Ghellinck and J.-P. Vial, \u201cA polynomial Newton method for linear programming,\u201d Algorithmica, vol. 1, pp. 425\u2013453, 1986.","journal-title":"Algorithmica"},{"key":"168456_CR8","volume-title":"Points int\u00e9rieurs et plans coupants: mise en oeuvre et d\u00e9veloppement d\u2019une m\u00e9thode pour l\u2019optimisation convexe et la programmation lin\u00e9aire structur\u00e9e de grande taille","author":"O. du Merle","year":"1995","unstructured":"O. du Merle, Points int\u00e9rieurs et plans coupants: mise en oeuvre et d\u00e9veloppement d\u2019une m\u00e9thode pour l\u2019optimisation convexe et la programmation lin\u00e9aire structur\u00e9e de grande taille, PhD Thesis, HEC-Section of Management Studies, University of Geneva, Switzerland, March 1995."},{"key":"168456_CR9","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1137\/0322061","volume":"6","author":"E. M. Gafni","year":"1984","unstructured":"E. M. Gafni and D. P. Bertsekas, \u201cTwo-metric projection methods for constrained optimization,\u201d SIAM Journal on Control and Optimization 22, vol. 6, pp. 936\u2013964, 1984.","journal-title":"SIAM Journal on Control and Optimization 22"},{"key":"168456_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0025-5610(96)00037-8","volume":"76","author":"J. L. Goffin","year":"1997","unstructured":"J. L. Goffin, J. Gondzio, R. Sarkissian et J. P. Vial, \u201cSolving nonlinear multicommodity flow problems by the analytic center cutting plane method,\u201d Mathematical Programming, vol. 76, pp. 131-154, 1997.","journal-title":"Mathematical Programming"},{"key":"168456_CR11","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38","author":"J. L. Goffin","year":"1992","unstructured":"J. L. Goffin, A. Haurie and J. P. Vial, \u201cDecomposition and nondifferentiable optimization with the projective algorithm,\u201d Management Science, vol. 38, pp. 284\u2013302, 1992.","journal-title":"Management Science"},{"key":"168456_CR12","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/S1052623493258635","volume":"6","author":"J. L. Goffin","year":"1996","unstructured":"J. L. Goffin, Z. Luo and Y. Ye, \u201cComplexity analysis of an interior cutting plane method for convex feasibility problems,\u201d SIAM J. Optimization, vol. 6, pp. 638-652, 1996.","journal-title":"SIAM J. Optimization"},{"key":"168456_CR13","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF00939559","volume":"65","author":"J. L. Goffin","year":"1989","unstructured":"J. L. Goffin and J. P. Vial, \u201cCutting planes and column generation techniques with the projective algorithm,\u201d Journal of Optimization Theory and its Applications, vol. 65, pp. 409\u2013429, 1989.","journal-title":"Journal of Optimization Theory and its Applications"},{"key":"168456_CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01580602","volume":"60","author":"J. L. Goffin","year":"1993","unstructured":"J. L. Goffin and J. P. Vial, \u201cOn the computation of weighted analytic centers and dual ellipsoids with the projective algorithm,\u201d Mathematical Programming, vol. 60, pp. 81\u201392, 1993.","journal-title":"Mathematical Programming"},{"key":"168456_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C. Gonzaga","year":"1992","unstructured":"C. Gonzaga, \u201cPath-following Method for Linear Programming,\u201d SIAM review, vol. 34, pp. 167\u2013224, 1992.","journal-title":"SIAM review"},{"key":"168456_CR16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial time algorithm for linear programming,\u201d Combinatorica, vol. 4, pp. 373-395, 1984.","journal-title":"Combinatorica"},{"key":"168456_CR17","first-page":"703","volume":"8","author":"J. E. Kelley","year":"1960","unstructured":"J. E. Kelley, \u201cThe cutting-plane method for solving convex programs,\u201d Journal of the SIAM, vol. 8, pp. 703\u2013712, 1960.","journal-title":"Journal of the SIAM"},{"key":"168456_CR18","volume-title":"Survivability in telecommunication networks\u201d","author":"A. Lisser","year":"1994","unstructured":"A. Lisser, R. Sarkissian et J. P. Vial, \u201cSurvivability in telecommunication networks\u201d, Universit\u00e9 de Gen\u00e8ve, Suisse, 1994."},{"key":"168456_CR19","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A.S. Nemirovsky","year":"1983","unstructured":"A.S. Nemirovsky and D.B. Yudin, Problem Complexity and Method Efficiency in Optimization, John Wiley: Chichester, 1983."},{"key":"168456_CR20","doi-asserted-by":"crossref","unstructured":"Y. Nesterov, \u201cComplexity estimates of some cutting plane methods based on the analytic barrier,\u201d Nondifferentiable and Large Scale Optimization, Mathematical Programming, Series B, J. L. Goffin and J. P. Vial, eds, vol. 69, pp. 149\u2013176, 1995.","DOI":"10.1007\/BF01585556"},{"key":"168456_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, \u201cA polynomial-time algorithm, based on Newton's method, for linear programming,\u201d Mathematical Programming, vol. 40, pp. 59\u201393, 1988.","journal-title":"Mathematical Programming"},{"key":"168456_CR22","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01840455","volume":"1","author":"M. J. Todd","year":"1986","unstructured":"M. J. Todd and B. P. Burrell, \u201cAn extension of Karmarkar's algorithm for linear programming using dual variables,\u201d Algorithmica, vol. 1, pp. 409\u2013424, 1986.","journal-title":"Algorithmica"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018318117350.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018318117350\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018318117350.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:04:41Z","timestamp":1752375881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018318117350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["168456"],"URL":"https:\/\/doi.org\/10.1023\/a:1018318117350","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}