Optimization Online Digest — March 2011
Applications — OR and Management Sciences
Solution Methods for the Multitrip Elementary Shortest Path Problem with Resource Constraints
Z Akca, TK Ralphs, RT Berger
New VNS heuristic for Total Flowtime Flowshop Scheduling Problem
Wagner Emanoel Costa, Marco César Goldbarg, Elizabeth G. Goldbarg
A generalized jobshop problem with more than one resource demand per task
Joachim Schauer, Cornelius Schwarz
Applications — Science and Engineering
Snow water equivalent estimation using blackbox optimization
Stéphane Alarie, Charles Audet, Vincent Garnier, Sébastien Le Digabel, LouisAlexandre Leclaire
Combinatorial Optimization
LP and SDP BranchandCut Algorithms for the Minimum Graph Bisection Problem: A Computational Comparison
Michael Armbruster, Christoph Helmberg, Marzena Fuegenschuh, Alexander Martin
2cliquebond of stable set polyhedra
Anna Galluccio, Claudio Gentile, Paolo Ventura
Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture
Edward D. Kim
Applications of the inverse theta number in stable set problems
Miklos Ujvari
Complementarity and Variational Inequalities
The Linear Complementarity Problem, Lemke Algorithm, Perturbation, and the Complexity Class PPAD
Ilan Adler, Sushil Verma
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
Projection methods in conic optimization
Didier Henrion, Jerome Malick
On the MoreauYosida regularization of the vector knorm related functions
Bin Wu, Chao Ding, Defeng Sun, KimChuan Toh
Global Optimization
Inverse polynomial optimization
Jean B Lasserre
Finding largest small polygons with GloptiPoly
Didier Henrion, Frederic Messine
Integer Programming
Lifted Inequalities for 0−1 MixedInteger Bilinear Covering Sets
Kwanghun Chung, JeanPhilippe P. Richard, Mohit Tawarmalani
A ChanceConstrained Model & Cutting Planes for Fixed Broadband Wireless Networks
Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno
Improving the LP bound of a MILP by dual concurrent branching and the relationship to cut generation methods
H. Georg Büsching
On nstep MIR and Partition Inequalities for Integer Knapsack and Singlenode Capacitated Flow Sets
Kiavash Kianfar
Designing AC Power Grids using Integer Linear Programming
Stephan Lemkens, Arie M.C.A. Koster
An algorithm for the separation of tworow cuts
Quentin Louveaux, Laurent Poirrier
BranchandCut for Separable Piecewise Linear Optimization: New Inequalities and Intersection with SemiContinuous Constraints
Ming Zhao, Ismael de Farias
BranchandCut for Separable Piecewise Linear Optimization: Computation
Ismael de Farias, Rajat Gupta, Ernee Kozyreff, Ming Zhao
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
The extreme rays of the 5x5 copositive cone
Roland Hildebrand
CONSTRAINED POLYNOMIAL OPTIMIZATION PROBLEMS WITH NONCOMMUTING VARIABLES
Kristijan Cafuta, Igor Klep, Janez Povh
Nonlinear Optimization
Convergence analysis of a proximal GaussNewton method
Saverio Salzo, Silvia Villa
SecondOrderCone Constraints for Extended TrustRegion Subproblems
Samuel Burer, Kurt Anstreicher
A Perry Descent Conjugate Gradient Method with Restricted Spectrum
Dongyi Liu, Genqi Xu
A Dwindling Filter Line Search Method for Unconstrained Optimization
Wenyu Sun, Yannan Chen
Robust Optimization
Planning Wireless Networks with Demand Uncertainty using Robust Optimization
Grit Claßen, Arie M. C. A. Koster, Anke Schmeink
Stochastic Programming
SDDP for some interstage dependent risk averse problems and application to hydrothermal planning
Vincent Guigues
