{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T06:40:13Z","timestamp":1736664013408,"version":"3.32.0"},"reference-count":99,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,2]],"date-time":"2006-12-02T00:00:00Z","timestamp":1165017600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,2,6]]},"DOI":"10.1007\/s10479-006-0111-y","type":"journal-article","created":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T17:23:04Z","timestamp":1164993784000},"page":"103-116","source":"Crossref","is-referenced-by-count":2,"title":["En hommage \u00e0 Joseph-Louis Lagrange et \u00e0 Pierre Huard"],"prefix":"10.1007","volume":"149","author":[{"given":"Monique","family":"Guignard","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,2]]},"reference":[{"key":"111_CR1","unstructured":"Ahn, S. (1996). On Solving Some Optimization Problems in Stochastic and Integer Programming with Applications in Finance and Banking. Ph.D. dissertation, University of Pennsylvania, OPIM Department."},{"key":"111_CR2","unstructured":"Ahn, S., L. Contesse, and M. Guignard. (latest revision March 2006). \u201cA Proximal Augmented Lagrangean Relaxation for Linear and Nonlinear Integer Programming.\u201d OPIM Department Report, University of Pennsylvania."},{"issue":"4","key":"111_CR3","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1287\/opre.51.4.613.16107","volume":"51","author":"N. Andalaft","year":"2003","unstructured":"Andalaft, N., P. Andalaft, M. Guignard, A. Magendzo, A. Wainer, and A. Weintraub. (2003). \u201cA Problem of Forest Harvesting and Road Building.\u201d Operations Research, 51(4), 613\u2013628.","journal-title":"Operations Research"},{"key":"111_CR4","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., T.L. Magnanti, and Richard T. Wong. (1989). \u201cA Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design.\u201d Operations Research, 37, 716\u2013740.","journal-title":"Operations Research"},{"key":"111_CR5","doi-asserted-by":"crossref","unstructured":"Bilde, O. and J. Krarup. (1977). \u201cSharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem.\u201d Annals of Discrete Mathematics, 1, 79\u201397.","DOI":"10.1016\/S0167-5060(08)70728-3"},{"issue":"1","key":"111_CR6","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/opre.4.1.100","volume":"4","author":"H. Bowman Edward","year":"1956","unstructured":"Bowman Edward H. (1956). \u201cProduction Scheduling by the Transportation Method of Linear Programming.\u201d Operations Research, 4(1), 100\u2013103.","journal-title":"Operations Research"},{"key":"111_CR7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0024-3795(93)90465-Z","volume":"188","author":"S. Boyd","year":"1993","unstructured":"Boyd, S. and L. El Ghaoui. (1993). \u201cMethod of Centers for Minimizing Generalized Eigenvalues.\u201d Linear Algebra and Applications, Special Issue on Systems & Control, 188, 63\u2013111,","journal-title":"Linear Algebra and Applications, Special Issue on Systems & Control"},{"key":"111_CR8","unstructured":"Broise, P., P. Huard, and J. Sentenac. (1968). Decomposition Des Programmes Mathematiques. Monographies de Recherche Op\u00e9rationnelle, Dunod, Paris."},{"key":"111_CR9","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/S0377-2217(02)00326-0","volume":"144","author":"R.J. Caron","year":"2002","unstructured":"Caron, R.J., H.J. Greenberg, and A.G. Holder. (2002). \u201cAnalytic Centers and Repelling Inequalities.\u201d European Journal of Operational Research, 144, 268\u2014290.","journal-title":"European Journal of Operational Research"},{"key":"111_CR10","unstructured":"Chajakis E. and M. Guignard. (1994). \u201cThe Setup Knapsack Problem.\u201d In S. Martello (Ed.), INFOR, Special Issue on Knapsack Problems, 124\u2013142."},{"issue":"1","key":"111_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1023067016014","volume":"26","author":"E. Chajakis","year":"2003","unstructured":"Chajakis E. and M. Guignard. (2003). \u201cScheduling Deliveries for Vehicles with Multiple Compartments.\u201d Journal of Global Optimization, special issue on Supply Chain Optimization, 26(1), 43\u201378.","journal-title":"Journal of Global Optimization"},{"key":"111_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0166-218X(97)00096-6","volume":"82","author":"B. Chen","year":"1998","unstructured":"Chen, B. and M. Guignard. (1998). \u201cPolyhedral Analysis and Decompositions for Capacitated Plant Location-Type Problems.\u201d Discrete Applied Mathematics, 82, 79\u201391.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"111_CR13","first-page":"67","volume":"C","author":"M. Cosnard","year":"1986","unstructured":"Cosnard M., Y. Robert, and D. Trystram. (1986). \u201cR\u00e9solution Parall\u00e8le De Syst\u00e8mes Lin\u00e9aires Denses Par Diagonalisation.\u201d E.D.F. Bulletin de la Direction des Etudes et des Recherches C(2), 67\u201387.","journal-title":"E.D.F. Bulletin de la Direction des Etudes et des Recherches"},{"key":"111_CR14","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/BF01396364","volume":"54","author":"T.J. Dekker","year":"1989","unstructured":"Dekker T.J. and W. Hoffmann. (1989). \u201cRehabilitation of the Gauss-Jordan Algorithm.\u201d N\u00fcmerische Mathematik, 54, 591\u2013599.","journal-title":"N\u00fcmerische Mathematik"},{"key":"111_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0377-0427(94)90302-6","volume":"50","author":"T.J. Dekker","year":"1994","unstructured":"Dekker T.J., W. Hoffmann, and K. Potma. (1994). \u201cParallel Algorithms for Solving Large Linear Systems.\u201d Journal of Computational and Applied Mathematics, 50, 221\u2013232.","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"3","key":"111_CR16","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02684391","volume":"58","author":"T.J. Dekker","year":"1997","unstructured":"Dekker T.J., W. Hoffmann, and K. Potma. (1997). \u201cStability of the Gauss-Huard Algorithm with Partial Pivoting.\u201d Computing, 58(3), 225\u2013244.","journal-title":"Computing"},{"key":"111_CR17","unstructured":"de Matta, R. (1989). On Solving Production Scheduling Problems with Changeover Cost Using Lagrangean Relaxation. Ph.D. dissertation, Dept. of Decision Sciences, the University of Pennsylvania."},{"issue":"3","key":"111_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.42.3.492","volume":"42","author":"R. de Matta","year":"1994","unstructured":"de Matta, R. and M. Guignard. (1994). Dynamic Production Scheduling for A Process Industry. Operations Research, 42(3), 1\u201312.","journal-title":"Operations Research"},{"key":"111_CR19","unstructured":"Denel, J., J.-C. Fiorot, and P. Huard. (1979). \u201cMaximisation D\u2019une Fonction Concave Lin\u00e9aire Par Morceaux, Cas Sans Et Avec Contraintes, M\u00e9thode Finie De La Plus Forte Pente.\u201d Research Report ANO-004, Universit\u00e9 des sciences et technologies de Lille (Lille-1)."},{"issue":"3","key":"111_CR20","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1051\/m2an\/1981150301951","volume":"15","author":"J. Denel","year":"1981","unstructured":"Denel, J., J.-C. Fiorot, and P. Huard. (1981). \u201cThe Steepest Ascent Method for the Linear Programming Problem.\u201d RAIRO Analyse Numerique, 15(3), 195\u2013200.","journal-title":"RAIRO Analyse Numerique"},{"issue":"1\u20134","key":"111_CR21","first-page":"359","volume":"43","author":"B.L. Dietrich","year":"1993","unstructured":"Dietrich, B.L. and L.F. Escudero. (1993). \u201cOn modelling the Maximum Workload Allocation for Parallel Unrelated Machines with Setups.\u201d Annals of Operations Research, 43(1\u20134), 359\u201377.","journal-title":"Annals of Operations Research"},{"key":"111_CR22","unstructured":"Dodu, J.-C. and P. Huard. (1988). \u201cAlgorithme \u00e0 p\u00e9nalisation simple : m\u00e9thode quadratique s\u00e9quentielle non r\u00e9alisable \u00e0 convergence globale.\u201d Rapport de recherche\/INRIA, RR 0925, 0249\u20136399."},{"key":"111_CR23","unstructured":"Dodu, J.-C. and P. Huard. (1990). \u201cM\u00e9thodes de Quasi-Newton en Optimisation Non Linaire.\u201d EDF, HR.30\u20132245. 96 pages."},{"key":"111_CR24","unstructured":"Dodu, J.-C. and P. Huard. (1993). Quasi-Newton Methods in Nonlinear Optimization. Research Report 93NJ00024, EDF, Direction des \u00e9tudes et de la recherche (Clamart)."},{"key":"111_CR25","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D.E. Erlenkotter","year":"1978","unstructured":"Erlenkotter, D.E. (1978). \u201cA Dual-Based Procedure for Uncapacitated Facility Location.\u201d Operations Research, 26, 992\u20131009.","journal-title":"Operations Research"},{"key":"111_CR26","unstructured":"Escudero, L.F., M. Guignard, and K. Malik. (1994). \u201cA Langrangian Relax-and-Cut Approach for the Sequential Ordering Problem with Precedence Relationships.\u201d In C. Ribeiro (Ed.) Annals of Operations Research 50, Applications of Combinatorial Optimization, pp. 219\u2013237."},{"key":"111_CR27","unstructured":"Fiorot, J.-C. and P. Huard. (1974). \u201cUne approche th\u00e9orique du probl\u00e8me de lin\u00e9arisation en programmation math\u00e9matique convexe.\u201d Research Report P-042, Universit\u00e9 des sciences et technologies de Lille (Lille-1)."},{"key":"111_CR28","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BFb0120844","volume":"10","author":"J.-C. Fiorot","year":"1979","unstructured":"Fiorot, J.-C. and P. Huard. (1979). \u201cComposition and Union of General Algorithms of Optimization.\u201d Mathematical Programming Study, 10, 69\u201385.","journal-title":"Mathematical Programming Study"},{"issue":"1","key":"111_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L. (1981). \u201cThe Lagrangian Relaxation Method for Solving Integer Programming Problems.\u201d Management Science, 27 (1), 1\u201318.","journal-title":"Management Science"},{"key":"111_CR30","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"M.L. Fisher","year":"1986","unstructured":"Fisher, M.L., R. Jaikumar, L.N. van Wassenhove. (1986). \u201cA Multiplier Adjustment Method for the Generalized Assignment Problem.\u201d Management Science, 32, 1095\u20131103.","journal-title":"Management Science"},{"key":"111_CR31","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1080\/02331930500342591","volume":"54","author":"M.L. Flegel","year":"2005","unstructured":"Flegel, M.L. and C. Kanzow. (2005). \u201cOn the Guignard Constraint Qualification for Mathematical Programs with Equilibrium Constraints, \u201c Optimization, 54, 517\u2013534.","journal-title":"Optimization"},{"key":"111_CR32","unstructured":"Fr\u00e9ville A. and M. Guignard. (1994). \u201cRelaxations for Minimax Problems.\u201d Investigacion Operativa, 119\u2013138."},{"issue":"1","key":"111_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1013001","volume":"13","author":"A.M. Geoffrion","year":"1971","unstructured":"Geoffrion, A.M. (1971). \u201cDuality in Nonlinear Programming.\u201d SIAM Review, 13(1), 1\u201337.","journal-title":"SIAM Review"},{"key":"111_CR34","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"Geoffrion, A.M. (1974). \u201cLagrangean Relaxation and its uses in Integer Programming.\u201d Mathematical Programming Study, 2, 82\u2013114.","journal-title":"Mathematical Programming Study"},{"issue":"1","key":"111_CR35","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1080\/05695557808975181","volume":"10","author":"A.M. Geoffrion","year":"1978","unstructured":"Geoffrion, A.M. and R. McBride. (1978). \u201cLagrangean Relaxation Applied to Capacitated Facility Location Problems.\u201d AIIE Transactions, 10(1), 40\u201347.","journal-title":"AIIE Transactions"},{"key":"111_CR36","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580728","volume":"40","author":"F. Glover","year":"1988","unstructured":"Glover, F. and D. Klingman. (1988). \u201cLayering Strategies for Creating Exploitable Structure in Linear and Integer Programs.\u201d Mathematical Programming 40, 165\u2013181.","journal-title":"Mathematical Programming"},{"key":"111_CR37","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1011298218729","volume":"19","author":"J. Gondzio","year":"2001","unstructured":"Gondzio, J., R. Sarkissian and J.-P. Vial. (2001). \u201cParallel Implementation of a Central Decomposition Method for Solving Large Scale Planning Problems.\u201d Computational Optimization and Applications 19, 5\u201329.","journal-title":"Computational Optimization and Applications"},{"key":"111_CR38","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/0120021","volume":"20","author":"F.J. Gould","year":"1971","unstructured":"Gould, F.J. and J.W. Tolle. (1971). \u201cA Necessary and Sufficient Qualification for Constrained Optimization.\u201d SIAM J. Appl. Math., 20, 164\u2013172.","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"111_CR39","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0307016","volume":"7","author":"M. Guignard","year":"1969","unstructured":"Guignard, M. (1969). \u201cGeneralized Kuhn-Tucker Conditions for Mathematical Programming Problems in a Banach Space.\u201d SIAM. J. Control, 7(2), 232\u2013241.","journal-title":"SIAM. J. Control"},{"key":"111_CR40","unstructured":"Guignard, M. (1970). \u201cConditions d\u2019optimalit\u00e9 et Dualit\u00e9 en programmation math\u00e9matique.\u201d Cahiers du Bureau Universitaire de Recherche Op\u00e9rationnelle, Institut de Statistique de l\u2019Universit\u00e9 de Paris, S\u00e9rie Recherche, Cahier n. 14, 62 pages."},{"key":"111_CR41","first-page":"108","volume":"R2","author":"M. Guignard","year":"1971","unstructured":"Guignard, M. (1971). \u201cUne condition d\u2019optimalit\u00e9 en programmation en nombres entiers.\u201d Revue Francaise d\u2019Informatique et de Recherche Op\u00e9rationelle, R2, 108\u2013113.","journal-title":"Revue Francaise d'Informatique et de Recherche Op\u00e9rationelle"},{"key":"111_CR42","unstructured":"Guignard, M. (1988). \u201cD\u00e9composition Lagrangienne Et Facettes De Polytopes Entiers.\u201d Comptes Rendus de l\u2019Acagemie des Sciences, Paris, France, t. 307, Serie 1, 225\u2013230."},{"key":"111_CR43","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0166-218X(93)90176-O","volume":"42","author":"M. Guignard","year":"1993","unstructured":"Guignard, M. (1993). \u201cSolving Makespan Minimization Problems with Lagrangean Decomposition.\u201d Discrete Applied Mathematics, 42, 17\u201329.","journal-title":"Discrete Applied Mathematics"},{"key":"111_CR44","unstructured":"Guignard, M. (1994). \u201cPrimal Relaxations for Integer Programming.\u201d VII CLAIO (Latin-Ibero American Conference on Operations Research and Systems Engineering), Santiago, Chile, also OPIM Department Research Report 94-02-01, University of Pennsylvania."},{"issue":"1","key":"111_CR45","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/S0377-2217(97)00034-9","volume":"105","author":"M. Guignard","year":"1998","unstructured":"Guignard, M. (1998). \u201cEfficient Cuts in Lagrangean Relax-and-Cut Schemes.\u201d European Journal of Operational Research, 105(1), 216\u2013223.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"111_CR46","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M. Guignard","year":"2003","unstructured":"Guignard, M. (2003). \u201cLagrangean Relaxation.\u201d TOP,11(2), 151\u2013228.","journal-title":"TOP"},{"key":"111_CR47","unstructured":"Guignard, M. and S. Kim. (1986). \u201cD\u00e9composition lagrangienne: un mod\u00e8le fournissant de meilleures bornes. \u201d Comptes Rendus de l\u2019Acad\u00e9mie des Sciences, Paris, France, t. 303, Serie 1, 667\u2013670."},{"issue":"2","key":"111_CR48","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M. Guignard","year":"1987","unstructured":"Guignard, M. and S. Kim. (1987). \u201cLagrangean Decomposition: A Model Yielding Stronger Bounds.\u201d Mathematical Programming, 39(2), 215\u2013228.","journal-title":"Mathematical Programming"},{"issue":"4","key":"111_CR49","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1051\/ro\/1987210403071","volume":"21","author":"M. Guignard","year":"1987","unstructured":"Guignard, M. and S. Kim. (1987). \u201cLagrangean Decomposition for Integer Programming: Theory and Applications.\u201d RAIRO \u2014 RO \u2014 Operations Research 21(4), 307\u2013323.","journal-title":"RAIRO \u2014 RO \u2014 Operations Research"},{"key":"111_CR50","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0377-2217(97)00362-7","volume":"111","author":"M. Guignard","year":"1998","unstructured":"Guignard M., C. Ryu, and K. Spielberg. (1998). \u201cModel Tightening for Integrated Timber Harvest and Transportation Planning.\u201d European J. of Operational Research, 111, 448\u2013460.","journal-title":"European J. of Operational Research"},{"key":"111_CR51","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/opre.37.4.658","volume":"37","author":"M. Guignard","year":"1989","unstructured":"Guignard, M. and M. Rosenwein. (1989). \u201cAn Improved Dual-Based Algorithm for the Generalized Assignment Problem.\u201d Operations Research, 37, 658\u2013663.","journal-title":"Operations Research"},{"key":"111_CR52","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/net.3230200306","volume":"20","author":"M. Guignard","year":"1990","unstructured":"Guignard, M. and M. Rosenwein. (1990). \u201cAn Application of Lagrangean Decomposition to Resource-Constrained Minimum Weighted Arborescence Problem.\u201d Networks, 20, 345\u2013359.","journal-title":"Networks"},{"key":"111_CR53","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01588244","volume":"17","author":"M. Guignard","year":"1979","unstructured":"Guignard, M. and K. Spielberg. (1979). \u201cA Direct Dual Method for the Mixed Plant Location Problem with Some Side Constraints.\u201d Mathematical Programming, 17, 198\u2013228.","journal-title":"Mathematical Programming"},{"issue":"1","key":"111_CR54","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.29.1.49","volume":"29","author":"M. Guignard","year":"1981","unstructured":"Guignard, M. and K. Spielberg. (1981). \u201cLogical Reduction Methods in 0\u20131 Programming.\u201d Operations Research, 29(1), 49\u201374.","journal-title":"Operations Research"},{"key":"111_CR55","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1139\/x87-233","volume":"17","author":"E.A. Gunn","year":"1987","unstructured":"Gunn, E.A. and A.K. Rai. (1987). \u201cModeling and Decomposition for Planning Long-Term Forest Harvesting in an Integrated Industry Structure.\u201d Can. J. For. Res. 17, 1507\u20131518.","journal-title":"Can. J. For. Res."},{"key":"111_CR56","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held, M. and R.M. Karp. (1970). \u201cThe Traveling-Salesman Problem and Minimum Spanning Trees.\u201d Operations Research, 18, 1138\u20131162.","journal-title":"Operations Research"},{"key":"111_CR57","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"Held, M. and R.M. Karp. (1971). \u201cThe Traveling-Salesman Problem and Minimum Spanning Trees: Part II.\u201d Mathematical Programming 1, 6\u201325.","journal-title":"Mathematical Programming"},{"key":"111_CR58","doi-asserted-by":"crossref","unstructured":"Hoffmann, W. (1998). \u201cThe Gauss-Huard Algorithm and LU Factorization.\u201d Linear Algebra and Its Applications, 275\u2013276, 281\u2013286.","DOI":"10.1016\/S0024-3795(97)10021-0"},{"key":"111_CR59","unstructured":"Hoffmann, W. and G.G. Pronk. (1994). \u201cImplementation of Gauss-Huard\u2019s Method on the IBM 9076 SP1.\u201d Technical Report CS-94-03, Department of Computer Systems, Faculty of Mathematics and Computer Science, University of Amsterdam."},{"key":"111_CR60","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0167-739X(94)90037-X","volume":"10","author":"W. Hoffmann","year":"1994","unstructured":"Hoffmann, W., K. Potma, and G.G. Pronk. (1994). \u201cSolving Dense Linear Systems by Gauss-Huard\u2019s Method on a Distributed Memory System.\u201d Future Generation Computer Systems, 10, 321\u2013325.","journal-title":"Future Generation Computer Systems"},{"key":"111_CR61","unstructured":"Huard, P. (1961). \u201cSur l\u2019ecriture du ma\u00eetre-programme dans le cas d\u2019un programme satellite d\u00e9compos\u00e9.\u201d Technical report, Note E.D.F. HX 410\/365."},{"key":"111_CR62","doi-asserted-by":"crossref","unstructured":"Huard, P. (1962). \u201cDual Programs.\u201d IBM J. of Res. and Dev., 137\u2013139.","DOI":"10.1147\/rd.61.0137"},{"key":"111_CR63","unstructured":"Huard, P. (1963a). Convex Programming\u2014Dual Algorithm. Research Report 63\u201421, O.R. Center, University of California at Berkeley."},{"key":"111_CR64","unstructured":"Huard, P. (1963b). \u201cApplication Du Principe De D\u00e9composition Aux Programmes Math\u00e9matiques Non Lin\u00e9aires.\u201d Technical report, Note E.D.F. HR 5467."},{"key":"111_CR65","unstructured":"Huard P. (1964a). \u201cMath\u00e9matiques Des Programmes Economiques.\u201d Monographies de Recherche Op\u00e9rationnelle, Dunod, Paris."},{"key":"111_CR66","unstructured":"Huard, P. (1964b). \u201cR\u00e9solution des programmes math\u00e9matiques par la m\u00e9thode des centres.\u201d Technical report, Note E.D.F. HR 5690."},{"key":"111_CR67","unstructured":"Huard, P. (1967). \u201cResolution of Mathematical Programming with Nonlinear Constraints by the Method of Centers.\u201d In J. Abadie, (Ed.), Nonlinear Programming, North Holland, Amsterdam, pp. 207\u2013219."},{"key":"111_CR68","doi-asserted-by":"crossref","unstructured":"Huard, P. (1970). \u201cA Method of Centers by Upper-Bounding Functions with Applications.\u201d In J. B. Rosen, O. L. Mangasarian and K. Ritter, (Eds.) Nonlinear Programming, Proceedings of a Symposium held at the University of Wisconsin, Madison, Wisconsin, USA, May 1970, Academic Press, New York, pp. 1\u201330.","DOI":"10.1016\/B978-0-12-597050-1.50005-1"},{"key":"111_CR69","unstructured":"Huard, P. (1975a). \u201cLa m\u00e9thode du gradient projet\u00e9 dans le cas de contraintes non-lin\u00e9aires.\u201d Research Report P-058, Universit\u00e9 des sciences et technologies de Lille (Lille-1)."},{"key":"111_CR70","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF01580449","volume":"8","author":"P. Huard","year":"1975b","unstructured":"Huard, P. (1975b). \u201cOptimization Algorithms and Point-to-Set Maps.\u201d Mathematical Programming, 8, 308\u2013331.","journal-title":"Mathematical Programming"},{"key":"111_CR71","unstructured":"Huard, P. (1976). \u201cImplementation of Gradient Methods by Tangential Discretization.\u201d Research Report P-073, Universit\u00e9 des sciences et technologies de Lille (Lille-1). Appeared in 1979 in JOTA, 28(4), 483\u2013499."},{"key":"111_CR72","first-page":"79","volume":"2","author":"P. Huard","year":"1979a","unstructured":"Huard, P. (1979a). \u201cLa methode Simplex sans inverse \u00e9xplicite.\u201d E. D. F.\u2014Bulletin de la D. E. R., S\u00e9rie C, 2, 79\u201398.","journal-title":"E. D. F.\u2014Bulletin de la D. E. R., S\u00e9rie C"},{"key":"111_CR73","unstructured":"Huard, P. (1979b). \u201cLa methode de frank \u00e9t wolfe \u2018a petits pas\u2019.\u201d Research Report ANO-007, Universit\u00e9 des Sciences et Technologies de Lille (Lille-1)."},{"key":"111_CR74","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BFb0120846","volume":"10","author":"P. Huard","year":"1979c","unstructured":"Huard, P. (1979c). \u201cExtensions of Zangwill\u2019s Theorem.\u201d Mathematical Programming Study, 10, 98\u2013103.","journal-title":"Mathematical Programming Study"},{"key":"111_CR75","unstructured":"Huard, P. (1981). \u201cUne approche synth\u00e9tique des recherches lin\u00e9aires dans les m\u00e9thodes de pente.\u201d Research Report ANO-044, Universit\u00e9 des Sciences et Technologies de Lille (Lille-1)."},{"key":"111_CR76","unstructured":"Huard, P. (1982). \u201cUn algorithme g\u00e9n\u00e9ral de gradient r\u00e9duit.\u201d Research Report ANO-066, Universit\u00e9 des Sciences et Technologies de Lille (Lille-1)."},{"key":"111_CR77","unstructured":"J\u00f6rnsten, K.O., M. N\u00e4sberg, and P.A. Smeds. (1985). \u201cVariable Splitting\u2014A New Lagrangean Relaxation Approach to Some Mathematical Programming Models.\u201d Report LiTH-MAT-R-85-04, Department of Mathematics, Link\u00f6ping Institute of Technology, Sweden."},{"key":"111_CR78","doi-asserted-by":"crossref","unstructured":"Karmarkar, U.S. and L. Schrage. (1985). \u201cThe Deterministic Dynamic Product Cycling Problem.\u201d Operations Research, 33(2), 326\u2013345.","DOI":"10.1287\/opre.33.2.326"},{"key":"111_CR79","unstructured":"Karush, W. (1939). \u201cMinima of Functions of Several Variables with Inequalities as Side Constraints.\u201d M.Sc. dissertation, Dept. of Mathematics, Univ. of Chicago, Chicago, Ill."},{"key":"111_CR80","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W. and A.W. Tucker. (1951). \u201cNonlinear Programming.\u201d In J. Neyman (Ed.), Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, Univ. of California Press, Berkeley, California, pp. 481\u2013492.","DOI":"10.1525\/9780520411586-036"},{"key":"111_CR81","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0377-0427(90)90046-3","volume":"32","author":"P. Laurent-Gengoux","year":"1990","unstructured":"Laurent-Gengoux, P. and D. Trystram. (1990). \u201cA New Presentation of the Conjugate Direction Algorithm.\u201d Journal of Computational and Applied Mathematics, 32, 417\u2013422.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"111_CR82","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1057\/jors.1996.152","volume":"47","author":"H. Lee","year":"1996","unstructured":"Lee, H. and M. Guignard. (1996). \u201cA Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups.\u201d J. Operational Research Society, 47, 1247\u20131261.","journal-title":"J. Operational Research Society"},{"key":"111_CR83","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/BF02165238","volume":"8","author":"B.-T. Lieu","year":"1966","unstructured":"Lieu, B.-T. and P. Huard. (1966). \u201cLa m\u00e9thode des centres dans un espace topologique.\u201d N\u00fcmerische Mathematik, 8, 56\u201357.","journal-title":"N\u00fcmerische Mathematik"},{"issue":"3","key":"111_CR84","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/0022-247X(75)90111-0","volume":"51","author":"O.L. Mangasarian","year":"1975","unstructured":"Mangasarian, O.L. (1975). \u201cSecond Order and Higher Order Duality in Nonlinear Programming.\u201d J. Math. Anal. Appl., 51 (3), 607\u2013620.","journal-title":"J. Math. Anal. Appl."},{"key":"111_CR85","unstructured":"Michelon, P. (1992). Private Communication."},{"key":"111_CR86","unstructured":"Michelon, P. and N. Maculan. (1992). \u201cSolving the Lagrangean Dual Problem in Integer Programming.\u201d Department d\u2019Informatique et de Recherche Operationnelle, Universit\u00e9 de Montr\u00e9al, Publication 82."},{"key":"111_CR87","unstructured":"Minoux, M. (1983). \u201cLagrangean Decomposition.\u201d Oral communication."},{"key":"111_CR88","unstructured":"Opaswongkarn, K. (1984). Single and Multi-Commodity Plant Location Problems. Ph.D. dissertation, Dept. of Decision Sciences, the University of Pennsylvania."},{"key":"111_CR89","unstructured":"Potma, K. and W. Hoffmann. (1994). \u201cPerformance Evaluation of Gauss-Huard\u2019s Method for Hierarchical Memory Systems.\u201d Report CS-94\u201307, University of Amsterdam (NL). Institute for logic, language and computation."},{"key":"111_CR90","first-page":"1","volume":"30","author":"H. Reinoso","year":"1992","unstructured":"Reinoso, H. and N. Maculan. (1992). \u201cLagrangean Decomposition in Integer Linear Programming: A New Scheme.\u201d INFOR, 30, 1\u20135.","journal-title":"INFOR"},{"key":"111_CR91","unstructured":"Ribeiro, C. (1983). \u201cAlgorithmes de recherche de plus courts chemins avec contraintes: etude th\u00e9orique, impl\u00e9mantation et parall\u00e9lisation.\u201d Doctoral Dissertation, Paris."},{"key":"111_CR92","unstructured":"Ribeiro, C. and M. Minoux. (1984). \u201cSolving Hard Constrained Shortest Paths Problems.\u201d ORSA-TIMS Meeting, Dallas."},{"key":"111_CR93","first-page":"303","volume":"53","author":"C. Ribeiro","year":"1986","unstructured":"Ribeiro, C. and M. Minoux. (1986). \u201cSolving Hard Constrained Shortest Paths Problems by Lagrangean Relaxation and Branch-and-Bound Algorithme.\u201d Methods of Operations Research 53, 303\u2013316.","journal-title":"Methods of Operations Research"},{"key":"111_CR94","unstructured":"Roos, C. (2002). \u201cInterior-Point Methods for Linear Optimization.\u201d In P. Pardalos and M. Resende, (Eds.) Handbook of Applied Optimization, New York, USA, Oxford University Press, pp. 21\u201339."},{"key":"111_CR95","unstructured":"Roos, K. (2004). \u201cFrom Linear Optimization to Conic Optimization.\u201d NMC 2004, Tilburg, April 17, 2004, and Seminar, Department of Mathematics, Universitas Padjadjaran, Bandung, Indonesia, August 21, 2004."},{"issue":"3","key":"111_CR96","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1287\/mnsc.26.3.274","volume":"26","author":"F. Shepardson","year":"1980","unstructured":"Shepardson, F. and R.E. Marsten. (1980). \u201cA Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem.\u201d Management Science, 26(3), 274\u2013281.","journal-title":"Management Science"},{"key":"111_CR97","unstructured":"Trick, M. (1987). \u201cNetworks with Additonal Structured Constraints,\u201d Ph.D. Thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology."},{"key":"111_CR98","unstructured":"Vajda, S. (1974). \u201cTest of Optimality.\u201d In P. L. Hammer and G. Zoutendijk, (Eds.) Mathematical programming in theory and practice, Proceedings of the NATO advanced study institute, Figueira da Foz, Portugal, June 12\u201323, 1972, North-Holland Pub. Co., Amsterdam, ISBN 044410741X."},{"issue":"2","key":"111_CR99","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.aml.2004.04.008","volume":"18","author":"X.M. Yang","year":"2005","unstructured":"Yang X.M., X.Q. Yang, and K.L. Teo. (2005). \u201cHuard Type Second-Order Converse Duality for Nonlinear Programming.\u201d Appl. Math. Lett. 18(2), 205\u2013208.","journal-title":"Appl. Math. Lett."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0111-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0111-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0111-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T06:25:12Z","timestamp":1736663112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0111-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,2]]},"references-count":99,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2,6]]}},"alternative-id":["111"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0111-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2006,12,2]]}}}