|
Optimization Online Digest — December 2002
Combinatorial Optimization
A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics
Stanislav Busygin
The stable set problem and the lift-and-project ranks of graphs
Laszlo Liptak, Levent Tuncel
Convex and Nonsmooth Optimization
A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
Antonio Fuduli, Manlio Gaudioso, Giovanni Giallombardo
Integer Programming
Selected Topics in Column Generation
Marco E. Luebbecke, Jacques Desrosiers
Semidefinite programming and integer programming
Monique Laurent, Franz Rendl
An Efficient Exact Algorithm for the Vertex $p$-Center Problem and Computational Experiments for Different Set Covering Subproblems
T. Ilhan, F.A. Ozsoy, M.C. Pinar
Nonlinear Optimization
Iterative algorithms with seminorm-induced oblique projections
Yair Censor, Tommy Elfving
A Global Convergence Theory of a Filter Line Search Method for Nonlinear Programming
Choong Ming Chin
A globally convergent linearly constrained Lagrangian method for nonlinear optimization
Michael P. Friedlander, Michael A. Saunders
Robust Optimization
Robust Option Modelling
Frank Lutgens, Jos Sturm
On Robust 0-1 Optimization with Uncertain Cost Coefficients
Mustafa C. Pinar
|