{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:04:49Z","timestamp":1765886689289,"version":"3.41.2"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":[[1999,7]]},"DOI":"10.1023\/a:1008748810765","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"17-36","source":"Crossref","is-referenced-by-count":22,"title":["Warm Start and \u03b5-Subgradients in a Cutting Plane Scheme for Block-Angular Linear Programs"],"prefix":"10.1007","volume":"14","author":[{"given":"J.","family":"Gondizo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-P","family":"Vial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"203784_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF00249055","volume":"5","author":"A. Altman","year":"1996","unstructured":"A. Altman and K.C. Kiwiel, \u201cA note on some cutting plane methods for convex feasibility and minimization problems,\u201d Computational Optimization and Applications, vol. 5, pp. 175\u2013180, 1996.","journal-title":"Computational Optimization and Applications"},{"key":"203784_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-1-4613-3449-1_6","volume-title":"Interior Point Methods in Mathematical Programming","author":"E. Andersen","year":"1996","unstructured":"E. Andersen, J. Gondzio, C. Meszaros, and X. Xu, \u201cImplementation of interior point methods for large scale linear programming,\u201d in Interior Point Methods in Mathematical Programming, T. Terlaky (Ed.), Kluwer Academic Publishers: Dordrecht 1996, pp. 189\u2013252."},{"key":"203784_CR3","unstructured":"O. Bahn, A. Haurie, S. Kypreos, and J.-P. Vial, \u201cA multinational MARKAL model to study joint implementation of carbon dioxide emission reduction measures,\u201d in Joint Implementation of Climate Change Commitments, P. Ghosh and J. Puri (Eds.), Tata Energy Research Institute, 1994."},{"key":"203784_CR4","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":"203784_CR5","unstructured":"Cplex Optimization Inc., Incline Village, NV 89451\u20139436. Using the Cplex Callable Library, 1995."},{"key":"203784_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":"203784_CR7","unstructured":"J. Day and A. Haurie, Private communication, Logilab, University of Geneva, 1997."},{"key":"203784_CR8","unstructured":"O. du Merle, J.-L. Goffin, and J.-P. Vial, \u201cOn the comparative behavior of Kelley's cutting plane method and the analytic center cutting plane method,\u201d Technical Report, Logilab, University of Geneva, 102 Bd Carl-Vogt, CH-1211, March 1996. Computational Optimization and Applications (in press)."},{"key":"203784_CR9","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201d Mathematical Programming Society COAL Newsletter, vol. 13, pp. 10\u201312, 1985.","journal-title":"Mathematical Programming Society COAL Newsletter"},{"key":"203784_CR10","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":"203784_CR11","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0377-2217(93)90129-B","volume":"64","author":"J.-L. Goffin","year":"1993","unstructured":"J.-L. Goffin, A. Haurie, J.-P. Vial, and D.L. Zhu, \u201cUsing central prices in the decomposition of linear programs,\u201d European Journal of Operational Research, vol. 64, pp. 393\u2013409, 1993.","journal-title":"European Journal of Operational Research"},{"key":"203784_CR12","first-page":"187","volume-title":"Large Scale Optimization: State of the Art","author":"J.-L. Goffin","year":"1993","unstructured":"J.-L. Goffin, Z.Q. Luo, and Y. Ye, \u201cOn the complexity of a column generation algorithm for convex and quasiconvex feasibility problems,\u201d in Large Scale Optimization: State of the Art, W.W. Hager, D.W. Hearn, and P.M. Pardalos (Eds.), Kluwer Academic Publishers: Dordrecht, 1993, pp. 187\u2013196."},{"key":"203784_CR13","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/S1052623493258635","volume":"6","author":"J.-L. Goffin","year":"1996","unstructured":"J.-L. Goffin, Z.Q. Luo, and Y. Ye, \u201cComplexity analysis of an interior point cutting plane method for convex feasibility problems,\u201d SIAM Journal on Optimization, vol. 6, pp. 638\u2013652, 1996.","journal-title":"SIAM Journal on Optimization"},{"key":"203784_CR14","unstructured":"J.-L. Goffin and J.-P. Vial, \u201cShallow, deep and very deep cuts in the analytic center cutting plane method,\u201d Technical Report, Logilab, University of Geneva, 102 Bd Carl-Vogt, CH-1211, May 1996. Mathematical Programming (in press)."},{"key":"203784_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0377-2217(95)00163-K","volume":"85","author":"J. Gondzio","year":"1995","unstructured":"J. Gondzio, \u201cHOPDM (version 2.12)\u2014a fast LP solver based on a primal-dual interior point method,\u201d European Journal of Operational Research, vol. 85, pp. 221\u2013225, 1995.","journal-title":"European Journal of Operational Research"},{"key":"203784_CR16","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J. Gondzio","year":"1996","unstructured":"J. Gondzio, \u201cMultiple centrality corrections in a primal-dual method for linear programming,\u201d Computational Optimization and Applications, vol. 6, pp. 137\u2013156, 1996.","journal-title":"Computational Optimization and Applications"},{"key":"203784_CR17","first-page":"125","volume":"83","author":"J. Gondzio","year":"1998","unstructured":"J. Gondzio, \u201cWarm start of the primal-dual method applied in the cutting plane scheme,\u201d Mathematical Programming, vol. 83, pp. 125\u2013143, 1998.","journal-title":"Mathematical Programming"},{"key":"203784_CR18","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/0377-2217(96)00169-5","volume":"94","author":"J. Gondzio","year":"1996","unstructured":"J. Gondzio, O. du Merle, R. Sarkissian, and J.-P. Vial, \u201cACCPM\u2014a library for convex optimization based on an analytic center cutting plane method,\u201d European Journal of Operational Research, vol. 94, pp. 206\u2013211, 1996.","journal-title":"European Journal of Operational Research"},{"key":"203784_CR19","unstructured":"J. Gondzio and R. Sarkissian, \u201cColumn generation with the primal-dual method,\u201d Technical Report, Logilab, University of Geneva, 102 Bd Carl-Vogt, CH-1211, June 1996."},{"key":"203784_CR20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1093\/oso\/9780198538561.003.0003","volume-title":"Advances in Linear and Integer Programming","author":"J. Gondzio","year":"1996","unstructured":"J. Gondzio and T. Terlaky, \u201cA computational view of interior point methods for large scale linear programming,\u201d in Advances in Linear and Integer Programming, J. Beasley (Ed.), Oxford University Press: Oxford, 1996, pp. 103\u2013144."},{"key":"203784_CR21","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":"203784_CR22","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/S1052623494275768","volume":"7","author":"K.C. Kiwiel","year":"1997","unstructured":"K.C. Kiwiel, \u201cEfficiency of the analytic center cutting plane method for convex minimization,\u201d SIAM Journal on Optimization, vol. 7, pp. 336\u2013346, 1997.","journal-title":"SIAM Journal on Optimization"},{"key":"203784_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"I.J. Lustig","year":"1994","unstructured":"I.J. Lustig, R.E. Marsten, and D.F. Shanno, \u201cInterior point methods for linear programming: computational state of the art,\u201d ORSA Journal on Computing, vol. 6, pp. 1\u201314, 1994.","journal-title":"ORSA Journal on Computing"},{"issue":"5","key":"203784_CR24","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0360-5442(93)90019-A","volume":"18","author":"N. Nakicenovic","year":"1993","unstructured":"N. Nakicenovic, A. Gruebler, A. Inaba, S. Messner, S. Nilsson, Y. Nishimura, H-H. Rogner, A. Schaefer, L. Schrattenholzer, M. Strubegger, J. Swisher, D. Victor, and D. Wilson, \u201cLong-term strategies for mitigating global warming,\u201d Energy\u2014The International Journal, vol. 18,no. 5, pp. 409\u2013601, 1993.","journal-title":"Energy\u2014The International Journal"},{"key":"203784_CR25","first-page":"149","volume":"69","author":"Y. Nesterov","year":"1995","unstructured":"Y. Nesterov, \u201cComplexity estimates of some cutting plane methods based on the analytic center,\u201d Mathematical Programming, vol. 69, pp. 149\u2013176, 1995.","journal-title":"Mathematical Programming"},{"key":"203784_CR26","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":"203784_CR27","unstructured":"J.-P. Vial, \u201cA generic path-following algorithm with a sliding constraint and its application to linear programming and the computation of analytic centers,\u201d Technical Report, Logilab, University of Geneva, 102 Bd Carl-Vogt, CH-1211, February 1996."},{"key":"203784_CR28","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior Point Methods","author":"S. Wright","year":"1997","unstructured":"S. Wright, Primal-Dual Interior Point Methods, SIAM: Philadelphia, 1997."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008748810765.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008748810765\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008748810765.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:38:10Z","timestamp":1752377890000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008748810765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["203784"],"URL":"https:\/\/doi.org\/10.1023\/a:1008748810765","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}