All Areas Submissions - 2006

Combinatorial Optimization
Solving a combinatorial problem using a local optimization in ant based system
C-M. Pintea, D. Dumitrescu

Applications — OR and Management Sciences
A new model and a computational study for Demand-wise Shared Protection
Claus G. Gruber, Arie M.C.A. Koster, Sebastian Orlowski, Roland Wessaely, Adrian Zymolka

Applications — OR and Management Sciences
Extensions of Lo's semiparametric bound for European call options
Donglei Du, Javier Pena, Luis F. Zuluaga

Convex and Nonsmooth Optimization
Steplength Selection in Interior-Point Methods for Quadratic Programming
Frank Curtis, Jorge Nocedal

Other Topics
Existence of Equilibrium for Integer Allocation Problems
Somdeb Lahiri

Complementarity and Variational Inequalities
Using EPECs to model bilevel games in restructured electricity markets
Xinmin Hu, Daniel Ralph

Integer Programming
Two Families of Facets for the Two-Dimensional Mixed Integer Infinite Group Problem
Santanu Dey, Jean-Philippe Richard

Nonlinear Optimization
On the behavior of the conjugate-gradient method on ill-conditioned problems
Anders Forsgren

Applications — Science and Engineering
Efficient Schemes for Robust IMRT Treatment Planning
Arinbjorn Olafsson, Stephen Wright

Combinatorial Optimization
Zero-One Knapsack Problem and Genetic Algorithms
Shalin Shah

Other Topics
The Effects of Adding Objectives to an Optimization Problem on the Solution Set
Joerg Fliege

Convex and Nonsmooth Optimization
Exact regularization of linear programs
Michael P. Friedlander

Combinatorial Optimization
Hyperbolic Polynomials Approach to Van der Waerden/Schrijver-Valiant like Conjectures :\\ Sharper Bounds , Simpler Proofs and Algorithmic Applications
Leonid Gurvits

Combinatorial Optimization
Finding the best root node strategy for the approximation of the time-indexed bound in min-sum scheduling
Yunpeng Pan, Leyuan Shi

Nonlinear Optimization
Kantorovich's Majorants Principle for Newton's Method
Orizon Ferreira, Benar Svaiter

Linear, Cone and Semidefinite Programming
Generating and Measuring Instances of Hard Semidefinite Programs, SDP
Hua Wei, Henry Wolkowicz

Global Optimization
A Note on Sparse SOS and SDP Relaxations for Polynomial Optimization Problems over Symmetric Cones
Masakazu Koima, Masakazu Muramatsu

Applications — OR and Management Sciences
Computing robust basestock levels
Daniel Bienstock, Nuri Ozbay

Linear, Cone and Semidefinite Programming
The Rate of Convergence of the Augmented Lagrangian Method for Nonlinear Semidefinite Programming
Defeng Sun, Jie Sun, Liwei Zhang

Combinatorial Optimization
Dynamic Enumeration of All Mixed Cells
Tomohiko Mizutani, Akiko Takeda, Masakazu Kojima

Combinatorial Optimization
A pricing problem under Monge property
Oktay Gunluk

Robust Optimization
Single-Product Pricing via Robust Optimization
Aurelie Thiele

Nonlinear Optimization
Continuous Optimization Methods for Structure Alignments
Roberto Andreani, José Mario Martínez , Leandro Martínez , Flavio Yano

Integer Programming
Clique-based facets for the precedence constrained knapsack problem
Natashia Boland, Christopher Fricke, Gary Froyland, Renata Sotirov

Stochastic Programming
Stochastic Programming Approach to Optimization under Uncertainty
Alexander Shapiro