Optimization Online Digest — September 2003
Applications — OR and Management Sciences
Continuous Line Drawings via the Traveling Salesman Problem
Robert Bosch, Adrianne Herman
Constructing Domino Portraits
Robert Bosch
Applications — Science and Engineering
A Fast Swapbased Local Search Procedure for Location Problems
Mauricio G. C. Resende, Renato F. Werneck
A hybrid multistart heuristic for the uncapacitated facility location problem
Mauricio G. C. Resende, Renato F. Werneck
A masked spectral bound for maximumentropy sampling
Kurt Anstreicher, Jon Lee
Combinatorial Optimization
The Quadratic Selective Travelling Saleman Problem
Tommy Thomadsen, Thomas Stidsen
A BranchandCut Algorithm for Graph Coloring
Isabel MéndezDíaz, Paula Zabala
The Generalized Subgraph Problem: Complexity, Approximability and Polyhedra
Corinne Feremans, Martine Labbé, Adam Letchford, Juan José Salazar
The Bundle Method in Combinatorial Optimization
Ilse Fischer , Gerald Gruber, Franz Rendl, Renata Sotirov
Network Reinforcement
Francisco Barahona
Complementarity and Variational Inequalities
A robust SQP method for mathematical programs with linear complementarity constraints
Xinwei Liu, Georgia Perakis, Jie Sun
A Homogeneous Model for $P_0$ and $P_*$ Nonlinear Complementarity Problems
Akiko Yoshise
Convex and Nonsmooth Optimization
On the blockstructured distance to nonsurjectivity of sublinear mappings
Javier Pena
The structured distance to illposedness for conic systems
Adrian Lewis
Global Optimization
Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
Sunyoung Kim, Masakazu Kojima, Hayato Waki
Integer Programming
An Exact Algorithm for the Capacitated Vertex pCenter Problem
F.A. Ozsoy, M.C. Pinar
Decomposition and Dynamic Cut Generation in Integer Linear Programming
T.K. Ralphs, M.V. Galati
Valid inequalities based on simple mixedinteger sets
Sanjeeb Dash, Oktay Gunluk
Linear, Cone and Semidefinite Programming
A Comparative Study of New Barrier Functions for PrimalDual InteriorPoint Algorithms in Linear Optimization
Y.Q. Bai, M. Elghami, C. Roos
A Semidefinite Programming Approach for the Nearest Correlation Matrix Problem
Miguel F. Anjos, Nicholas J. Higham, Pawoumodom L. Takouda, Henry Wolkowicz
On Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems
Dennis Cheung, Felipe Cucker, Raphael Hauser
A Pivotting Procedure for a Class of SecondOrder Cone Programming
Masakazu Muramatsu
Sparsity in Sums of Squares of Polynomials
Masakazu Kojima, Sunyoung Kim, Hayato Waki
Local Minima and Convergence in LowRank Semidefinite Programming
Samuel Burer, Renato Monteiro
Network Optimization
Speeding up dynamic shortest path algorithms
Luciana S. Buriol, Mauricio G.C. Resende, Mikkel Thorup
Nonlinear Optimization
An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
Stephen Wright
