ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, Math. Programming ?, 2007. ,
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum, Mathematical Programming, vol.120, issue.1, 2007. ,
DOI : 10.1007/s10107-007-0191-8
Solving semidefinite quadratic problems within nonsmooth optimization algorithms, Computers & Operations Research, vol.23, issue.11, pp.1099-1118, 1996. ,
DOI : 10.1016/0305-0548(96)00006-8
URL : http://eprints.adm.unipi.it/1926/1/TR%2D95%2D10.ps.gz
Shortest path algorithms, Annals of Operations Research, vol.7, issue.1, pp.3-79, 1988. ,
DOI : 10.1007/BF02288320
The ellipsoid method and its predecessors, Recent Advances in System Modelling and Optimization, pp.127-141, 1987. ,
DOI : 10.1007/BFb0006784
Convex Analysis and Minimization Algorithms, 1993. ,
DOI : 10.1007/978-3-662-02796-7
A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization, IMA Journal of Numerical Analysis, vol.6, issue.2, pp.137-152, 1986. ,
DOI : 10.1093/imanum/6.2.137
Proximity control in bundle methods for convex nondifferentiable minimization, Mathematical Programming, vol.7, issue.1-3, pp.105-122, 1990. ,
DOI : 10.1007/BF01585731
A Cholesky dual method for proximal piecewise linear programming, Numerische Mathematik, vol.68, issue.3, pp.325-340, 1994. ,
DOI : 10.1007/s002110050065
A Projection-Proximal Bundle Method for Convex Nondifferentiable Minimization, Lecture Notes in Economics and Mathematical Systems, vol.477, pp.137-150, 1999. ,
DOI : 10.1007/978-3-642-45780-7_9
A Proximal Bundle Method with Approximate Subgradient Linearizations, SIAM Journal on Optimization, vol.16, issue.4, pp.1007-1023, 2006. ,
DOI : 10.1137/040603929
A Proximal???Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming, SIAM Journal on Optimization, vol.17, issue.4, pp.1015-1034, 2006. ,
DOI : 10.1137/050639284
Lagrangian Relaxation via Ballstep Subgradient Methods, Mathematics of Operations Research, vol.32, issue.3, pp.669-686, 2007. ,
DOI : 10.1287/moor.1070.0261
An inexact bundle variant suited to column generation, Mathematical Programming, vol.18, issue.4, 2007. ,
DOI : 10.1007/s10107-007-0187-4
URL : https://hal.archives-ouvertes.fr/inria-00109402
Proximal Decomposition Via Alternating Linearization, SIAM Journal on Optimization, vol.9, issue.3, pp.668-689, 1999. ,
DOI : 10.1137/S1052623495288064
A bundle-type algorithm for routing in??telecommunication data networks, Computational Optimization and Applications, vol.1, issue.4, 2007. ,
DOI : 10.1007/s10589-007-9160-7
Régularisation d'inéquations variationelles par approximations successives, RAIRO Rech. Opér, vol.4, issue.R3, pp.154-158, 1970. ,
A Survey of Algorithms for Convex Multicommodity Flow Problems, Management Science, vol.46, issue.1, pp.126-147, 2000. ,
DOI : 10.1287/mnsc.46.1.126.15132
Convex Analysis, 1970. ,
DOI : 10.1515/9781400873173
Monotone Operators and the Proximal Point Algorithm, SIAM Journal on Control and Optimization, vol.14, issue.5, pp.877-898, 1976. ,
DOI : 10.1137/0314056
Alpes 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4 ,
Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche, 2004. ,