-

 

 

 




Optimization Online





 

Optimization Online Digest — September 2001

Combinatorial Optimization

Greedy randomized adaptive search procedures
Mauricio G.C. Resende, Celso C. Ribeiro

New Benchmark Instances for the Steiner Problem in Graphs
Isabel Rosseti, Marcus Poggi de Arag„o, Celso Ribeiro, Eduardo Uchoa, Renato Werneck

Convex and Nonsmooth Optimization

Strong semismoothness of eigenvalues of symmetric matrices and its application to inverse eigenvalue problems
Defeng Sun, Jie Sun

Integer Programming

An Efficient Exact Algorithm for the Vertex p-Center Problem
T. Ilhan, M.C. Pinar

Linear, Cone and Semidefinite Programming

Simple Efficient Solutions for Semidefinite Programming
Henry Wolkowicz

Continuous trajectories for primal-dual potential-reduction methods
Reha H. Tutuncu

Stochastic Programming

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study
Bram Verweij, Shabbir Ahmed, Anton Kleywegt, George Nemhauser, Alexander Shapiro


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society