All Areas Submissions  June 2002
Optimization Software and Modeling Systems
NEOS Server 4.0 Administrative Guide
Elizabeth D. Dolan
Linear, Cone and Semidefinite Programming
A General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones
Masakazu Kojima, Sunyoung Kim, Hayato Waki
Linear, Cone and Semidefinite Programming
Characterization of the limit point of the central path in semidefinite programming
Göran Sporre, Anders Forgren
Linear, Cone and Semidefinite Programming
Geometry of homogeneous convex cones, duality mapping, and optimal selfconcordant barriers
Van Anh Truong, Levent Tuncel
Linear, Cone and Semidefinite Programming
Limiting behavior of the central path in semidefinite optimization
M. Halicka, E. De Klerk, C. Roos
Linear, Cone and Semidefinite Programming
An Improved Semidefinite Programming Relaxation for the Satisfiability Problem
Miguel F. Anjos
Global Optimization
Efficient Algorithms for Large Scale Global Optimization: LennardJones clusters
Marco Locatelli, Fabio Schoen
Combinatorial Optimization
Fractional Packing of Tjoins
Francisco Barahona
Integer Programming
Safe bounds in linear and mixedinteger programming
Arnold Neumaier, Oleg Shcherbina
Applications — Science and Engineering
Model Problems for the Multigrid Optimization of Systems Governed by Differential Equations
R.M. Lewis, S.G. Nash
Convex and Nonsmooth Optimization
A new exact penalty function
Waltraud Huyer, Arnold Neumaier
Combinatorial Optimization
Randomized heuristics for the MAXCUT problem
P. Festa, P. M. Pardalos, M. G. C. Resende, C. C. Ribeiro
