Optimization Online Digest — June 2001
Applications — OR and Management Sciences
An InventoryLocation Model: Formulation, Solution Algorithm and Computational Results
Mark Daskin, Collette Coullard, Z.J. Max Shen
A GRASP with pathrelinking for private virtual circuit routing
Mauricio G. C. Resende, Celso C. Ribeiro
On Solving The Progressive Party Problem as a MIP
Erwin Kalvelagen
Convex and Nonsmooth Optimization
Approximating Subdifferentials by Random Sampling of Gradients
James V. Burke, Adrian S. Lewis, Michael L. Overton
Two Numerical Methods for Optimizing Matrix Stability
James V. Burke, Adrian S. Lewis, Michael L. Overton
On the convergence of the central path in semidefinite optimization
Margareta Halicka, Etienne De Klerk, Cornelis Roos
Integer Programming
Sequence independent lifting for mixedinteger programming
Alper Atamturk
Augmented selfconcordant barriers and nonlinear optimization problems with finite complexity.
Yurii Nesterov, JeanPhilippe Vial
Linear, Cone and Semidefinite Programming
A Computational Study of a GradientBased LogBarrier Algorithm for a Class of LargeScale SDPs
Samuel Burer, Renato Monteiro, Yin Zhang
An InteriorPoint Perspective on Sensitivity Analysis in Semidefinite Programming
Alper Yildirim
Geometry of Semidefinite MaxCut Relaxations via Ranks
Miguel F. Anjos, Henry Wolkowicz
Improved complexity for maximum volume inscribed ellipsoids
K.M. Anstreicher
Nonlinear Optimization
Properties of the LogBarrier Function on Degenerate Nonlinear Programs
Stephen J. Wright, Dominique Orban
Automatic Differentiation Tools in Optimization Software
Jorge More'
Componentwise fast convergence in the solution of fullrank systems of nonlinear equations
N.I.M. Gould, D. Orban, A. Sartenaer, Ph.L. Toint
Stochastic Programming
On a new collection of stochastic linear programming test
problems
K. A. Ariyawansa, Andrew J. Felt
