All Areas Submissions - March 2011

Complementarity and Variational Inequalities
The Linear Complementarity Problem, Lemke Algorithm, Perturbation, and the Complexity Class PPAD
Ilan Adler, Sushil Verma

Integer Programming
Lifted Inequalities for 0−1 Mixed-Integer Bilinear Covering Sets
Kwanghun Chung, Jean-Philippe P. Richard, Mohit Tawarmalani

Linear, Cone and Semidefinite Programming
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
Bissan Ghaddar, Juan C. Vera, Miguel F. Anjos

Nonlinear Optimization
Convergence analysis of a proximal Gauss-Newton method
Saverio Salzo, Silvia Villa

Combinatorial Optimization
LP and SDP Branch-and-Cut Algorithms for the Minimum Graph Bisection Problem: A Computational Comparison
Michael Armbruster, Christoph Helmberg, Marzena Fuegenschuh, Alexander Martin

Integer Programming
A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless Networks
Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno

Robust Optimization
Planning Wireless Networks with Demand Uncertainty using Robust Optimization
Grit Claßen, Arie M. C. A. Koster, Anke Schmeink

Convex and Nonsmooth Optimization
Use of quadratic models with mesh adaptive direct search for constrained black box optimization
Andrew R Conn, Sébastien Le Digabel

Applications — Science and Engineering
Snow water equivalent estimation using blackbox optimization
Stéphane Alarie, Charles Audet, Vincent Garnier, Sébastien Le Digabel, Louis-Alexandre Leclaire

Nonlinear Optimization
Second-Order-Cone Constraints for Extended Trust-Region Subproblems
Samuel Burer, Kurt Anstreicher

Nonlinear Optimization
A Perry Descent Conjugate Gradient Method with Restricted Spectrum
Dongyi Liu, Genqi Xu

Linear, Cone and Semidefinite Programming
The extreme rays of the 5x5 copositive cone
Roland Hildebrand

Nonlinear Optimization
A Dwindling Filter Line Search Method for Unconstrained Optimization
Wenyu Sun

Convex and Nonsmooth Optimization
Projection methods in conic optimization
Didier Henrion, Jerome Malick

Applications — OR and Management Sciences
Solution Methods for the Multi-trip Elementary Shortest Path Problem with Resource Constraints
Z Akca, TK Ralphs, RT Berger

Integer Programming
Improving the LP bound of a MILP by dual concurrent branching and the relationship to cut generation methods
H. Georg Büsching

Integer Programming
On n-step MIR and Partition Inequalities for\\ Integer Knapsack and Single-node Capacitated Flow Sets
Kiavash Kianfar

Integer Programming
Designing AC Power Grids using Integer Linear Programming
Stephan Lemkens, Arie M.C.A. Koster

Combinatorial Optimization
2-clique-bond of stable set polyhedra
Anna Galluccio, Claudio Gentile, Paolo Ventura

Integer Programming
An algorithm for the separation of two-row cuts
Quentin Louveaux, Laurent Poirrier

Combinatorial Optimization
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture
Edward D. Kim

Applications — OR and Management Sciences
New VNS heuristic for Total Flowtime Flowshop Scheduling Problem
Wagner Emanoel Costa, Marco César Goldbarg, Elizabeth G. Goldbarg

Stochastic Programming
SDDP for some interstage dependent risk averse problems and application to hydro-thermal planning
Vincent Guigues

Global Optimization
Inverse polynomial optimization
Jean B Lasserre

Linear, Cone and Semidefinite Programming
CONSTRAINED POLYNOMIAL OPTIMIZATION PROBLEMS WITH NONCOMMUTING VARIABLES
Kristijan Cafuta, Igor Klep, Janez Povh

Global Optimization
Finding largest small polygons with GloptiPoly
Didier Henrion, Frederic Messine

Integer Programming
Branch-and-Cut for Separable Piecewise Linear Optimization: New Inequalities and Intersection with Semi-Continuous Constraints
Ming Zhao, Ismael de Farias

Combinatorial Optimization
Applications of the inverse theta number in stable set problems
Miklos Ujvari

Integer Programming
Branch-and-Cut for Separable Piecewise Linear Optimization: Computation
Ismael de Farias, Rajat Gupta, Ernee Kozyreff, Ming Zhao

Applications — OR and Management Sciences
A generalized job-shop problem with more than one resource demand per task
Joachim Schauer, Cornelius Schwarz

Convex and Nonsmooth Optimization
On the Moreau-Yosida regularization of the vector k-norm related functions
Bin Wu, Chao Ding, Defeng Sun, Kim-Chuan Toh