O. du Merle

Generating author description...

All published works

Action	Title	Year	Authors
+	Proximal ACCPM, a Cutting Plane Method for Column Generation and Lagrangian Relaxation: Application to the P-Median Problem	2002	O. du Merle Jean-Philippe Vial
+	Stabilized column generation	1999	O. du Merle Daniel L. Villeneuve Jacques Desrosiers Pierre Hansen
+ PDF Chat	An Interior Point Algorithm for Minimum Sum-of-Squares Clustering	1999	O. du Merle Pierre Hansen Brigitte Jaumard Nenad Mladenović
+	ACCPM — A library for convex optimization based on an analytic center cutting plane method	1996	Jacek Gondzio O. du Merle Robert Sarkissian J.‐P. Vial
+	A cutting plane method from analytic centers for stochastic programming	1995	Olivier Bahn O. du Merle Jean‐Louis Goffin J.‐P. Vial
+	Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming	1994	Olivier Bahn Jean‐Louis Goffin J.‐P. Vial O. du Merle

Common Coauthors

Coauthor	Papers Together
J.‐P. Vial	3
Pierre Hansen	2
Jean‐Louis Goffin	2
Olivier Bahn	2
Nenad Mladenović	1
Jacques Desrosiers	1
Jean-Philippe Vial	1
Brigitte Jaumard	1
Jacek Gondzio	1
Robert Sarkissian	1
Daniel L. Villeneuve	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	The Cutting-Plane Method for Solving Convex Programs	1960	James E. Kelley	6
+	Decomposition and Nondifferentiable Optimization with the Projective Algorithm	1992	Jean‐Louis Goffin Alain Haurie J.‐P. Vial	5
+	The Decomposition Algorithm for Linear Programs	1961	George B. Dantzig Philip Wolfe	4
+	A polynomial newton method for linear programming	1986	Guy de Ghellinck J.‐P. Vial	3
+	Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming	1994	Olivier Bahn Jean‐Louis Goffin J.‐P. Vial O. du Merle	2
+	Newton's method for convex programming and Tchebycheff approximation	1959	E. W. Cheney A. A. Goldstein	2
+ PDF Chat	Augmented self-concordant barriers and nonlinear optimization problems with finite complexity	2004	Yu. Nesterov Jean-Philippe Vial	2
+	Partitioning procedures for solving mixed-variables programming problems	1962	J. F. Benders	2
+	On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm	1993	Jean‐Louis Goffin J.‐P. Vial	2
+	New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation	1988	Gy. Sonnevend	2
+	Cutting planes and column generation techniques with the projective algorithm	1990	Jean‐Louis Goffin J.‐P. Vial	2
+	Variable metric bundle methods: From conceptual to implementable forms	1997	Claude Lemaréchal Claudia Sagastizábal	1
+	A cutting plane method from analytic centers for stochastic programming	1995	Olivier Bahn O. du Merle Jean‐Louis Goffin J.‐P. Vial	1
+	Implementing cholesky factorization for interior point methods of linear programming	1993	Jacek Gondzio	1
+	Using an interior point method for the master problem in a decomposition approach	1997	Jacek Gondzio Robert Sarkissian J.‐P. Vial	1
+	Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method	1991	Clóvis C. Gonzaga	1
+	Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems	1982	Stephen C. Graves	1
+	A polynomial method of approximate centers for linear programming	1992	C. Roos Jean-Philippe Vial	1
+	Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method	2002	Jean‐Louis Goffin Jean-Philippe Vial	1
+ PDF Chat	Efficient solution of two-stage stochastic linear programs using interior point methods	1992	John R. Birge Derek F. Holmes	1
+	Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method	1991	Clóvis C. Gonzaga	1
+	Manifestations of the Schur complement	1974	Richard W. Cottle	1
+	Path-Following Methods for Linear Programming	1992	Clóvis C. Gonzaga	1
+	Advances in Linear and Integer Programming	1996	J. E. Beasley	1
+	Stabilized column generation	1999	O. du Merle Daniel L. Villeneuve Jacques Desrosiers Pierre Hansen	1
+ PDF Chat	Solving nonlinear multicommodity flow problems by the analytic center cutting plane method	1997	Jean‐Louis Goffin Jacek Gondzio Robert Sarkissian J.‐P. Vial	1
+	Complexity estimates of some cutting plane methods based on the analytic barrier	1995	Yu. Nesterov	1
+	A Potential Reduction Algorithm Allowing Column Generation	1992	Yinyu Ye	1
+	A cutting plane algorithm for convex programming that uses analytic centers	1995	David S. Atkinson Pravin M. Vaidya	1
+ PDF Chat	An Interior Point Algorithm for Minimum Sum-of-Squares Clustering	1999	O. du Merle Pierre Hansen Brigitte Jaumard Nenad Mladenović	1
+	Bicriterion Cluster Analysis	1980	Michel Delattre Pierre Hansen	1
+	Parallel bundle-based decomposition for large-scale structured mathematical programming problems	1990	Deepankar Medhi	1
+	Using central prices in the decomposition of linear programs	1993	Jean‐Louis Goffin Alain Haurie Jean-Philippe Vial Dinghuan Zhu	1
+	On a homogeneous algorithm for the monotone complementarity problem	1999	Erling D. Andersen Yinyu Ye	1
+	An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming	2006	Gy. Sonnevend	1
+	Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming	1988	John R. Birge Liqun Qi	1
+	Some methods for classification and analysis of multivariate observations	1967	James B. MacQueen	1
+	Linear Programming and Extensions	1963	George B. Dantzig	1
+	ACCPM — A library for convex optimization based on an analytic center cutting plane method	1996	Jacek Gondzio O. du Merle Robert Sarkissian J.‐P. Vial	1
+	Formulating Two-Stage Stochastic Programs for Interior Point Methods	1991	Irvin J. Lustig John M. Mulvey Tamra Carpenter	1
+	Lagrangian Relaxation for Integer Programming	2009	Arthur M. Geoffrion	1
+	Numerical methods for fuzzy clustering	1970	Enrique H. Ruspini	1
+	Large Scale Linear Programming Techniques	1988	Roger J.‐B. Wets	1
+	On Minimizing a Convex Function Subject to Linear Inequalities	1955	E. M. L. Beale	1
+ PDF Chat	Bundle-Based Decomposition: Conditions for Convergence	1989	Stephen M. Robinson	1
+	Geometric programming	1981	Mikuláš Luptáčik	1
+	Finding groups in data: an introduction to cluster analysis	1991		1
+	Mathematical Programming	1995	Brian Conolly S. Vajda	1
+	Constrained nonlinear programming	1989	Philip E. Gill Walter Murray M. A. Saunders Margaret H. Wright	1
+	Decomposition and Non-differentiable Optimization with the Projective Algorithm	1989	Jean‐Louis Goffin Alain Haurie Jean-Philippe Vial	1