Optimization Online


Optimization Online Digest — March 2011

Applications — OR and Management Sciences

Solution Methods for the Multi-trip 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 job-shop 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, Louis-Alexandre Leclaire

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

2-clique-bond 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 Moreau-Yosida regularization of the vector k-norm related functions
Bin Wu, Chao Ding, Defeng Sun, Kim-Chuan 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 Mixed-Integer Bilinear Covering Sets
Kwanghun Chung, Jean-Philippe P. Richard, Mohit Tawarmalani

A Chance-Constrained 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 n-step MIR and Partition Inequalities for Integer Knapsack and Single-node 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 two-row cuts
Quentin Louveaux, Laurent Poirrier

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

Branch-and-Cut 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

Kristijan Cafuta, Igor Klep, Janez Povh

Nonlinear Optimization

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

Second-Order-Cone Constraints for Extended Trust-Region 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 hydro-thermal planning
Vincent Guigues

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society