Optimization Online Digest — January 2005

Applications — OR and Management Sciences

Linear Programming Lower Bounds for Minimum Converter Wavelength Assignment in Optical Networks
Arie M.C.A. Koster, Adrian Zymolka

Convex Optimization of Centralized Inventory Operations
Samuel Burer, Moshe Dror

Rebalancing an Investment Portfolio in the Presence of Convex Transaction Costs
John E. Mitchell, Stephen E. Braun

A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses
Christoph Helmberg, Stefan Röhl

Applications — Science and Engineering

Optimization of discrete control systems with varying structure
Stephan Dempe, Shahlar F. Maharramov

Combinatorial Optimization

Further Extension of TSP Assign Neighborhood
Gregory Gutin, Fred Glover

A linear programming approach to increasing the weight of all minimum spanning trees
Francisco Barahona, Mourad Baiou

GRASP with path-relinking for the weighted maximum satisfiability problem
Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende

Short communication: a larger clique for a DIMACS test
Andrea Grosso, Marco Locatelli, Wayne, J. Pullan

Strengthened Semidefinite Bounds for Codes
Monique Laurent

Complementarity and Variational Inequalities

Stochastic Mathematical Programs with Equilibrium Constraints, Modeling and Sample Average Approximation
Alexander Shapiro, Huifu Xu

Convex and Nonsmooth Optimization

On the Minimum Volume Covering Ellipsoid of Ellipsoids
E. Alper Yildirim

Bregman distances, totally convex functions and a method for solving operator equations in Banach spaces
Dan Butnariu, Elena Resmerita

Algorithms for the quasiconvex feasibility problem
Yair Censor, Alexander Segal

Global Optimization

A Population Based Approach for Hard Global Optimization Problems Based on Dissimilarity Measures
Andrea Grosso, Marco Locatelli, Fabio Schoen

A PTAS for the minimization of polynomials of fixed degree over the simplex
Etienne de Klerk, Monique Laurent, Pablo Parrilo

Integer Programming

On generalized branching methods for mixed integer programming
Sanjay Mehrotra, Zhifeng Li

A branch and cut algorithm for solving the linear and quadratic integer programming problems
Yan Zizong, Fei Pusheng, Wan Zhongping

Linear, Cone and Semidefinite Programming

Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
C. Jansson, C. Keil

Nonlinear Optimization

A generating set search method exploiting curvature and sparsity
Lennart Frimannslund, Trond Steihaug

The NEWUOA software for unconstrained optimization without derivatives
M.J.D. Powell

Stochastic Programming

Two-Stage Stochastic Semidefinite Programming and Decomposition Based Interior Point Methods
Sanjay Mehrotra, M. Gokhan Ozevin

On Complexity of Multistage Stochastic Programs
Alexander Shapiro