|
Optimization Online Digest — October 2006
Applications — OR and Management Sciences
A Heuristic Approach for Big Bucket Production Planning Problems
Kerem Akartunali, Andrew J. Miller
A hybrid heuristic for the constrained two-dimensional non-guillotine orthogonal cutting problem
José F. Gonçalves, Mauricio G. C. Resende
Consistency of robust portfolio estimators
Katrin Schöttle, Ralf Werner
An integer programming approach to the OSPF weight setting problem
Amandeep Parmar, Shabbir Ahmed, Joel Sokol
What Multistage Stochastic Programming Can Do for Network Revenue Management
Victor DeMiguel, Nishant Mishra
GRASP with path-relinking for network migration scheduling
Diogo V. Andrade, Mauricio G. C. Resende
Applications — Science and Engineering
A Penalized Trimmed Squares Method for Deleting Outliers in Robust Regression
George Zioutas, Antonis Avramidis, Leonidas Pitsoulis
Iterative Solution Methods for Beam Angle and Fluence Map Optimization in Intensity Modulated Radiation Therapy Planning
Gino J. Lim, Jaewon Choi, Radhe Mohan
Computing nonnegative tensor factorizations
Michael P. Friedlander, Kathrin Hatz
A continuous GRASP to determine the relationship between drugs and adverse reactions
M. J. Hirsch, C. N. Meneses, P. M. Pardalos, M. A. Ragle, M. G. C. Resende
Combinatorial Optimization
Polyhedral combinatorics of a resource-constrained ordering problem part I: on the partial linear ordering polytope
Renaud Sirdey, Hervé Kerivin
Polyhedral combinatorics of a resource-constrained ordering problem part II: on the process move program polytope
Hervé Kerivin, Renaud Sirdey
New descriptions of the Lovász number and a Brooks-type theorem
Ujvári Miklós
Copositive and Semidefinite Relaxations of the Quadratic Assignment Problem
Janez Povh, Franz Rendl
Convex and Nonsmooth Optimization
Lyusternik theorem and regularity of collections of sets
Andrei V. Dmitruk, Alexander Ya. Kruger
A New Class of Interior Proximal Methods for Optimization over the Positive Orthant
Sissy da S. Souza, P. Roberto Oliveira
Integer Programming
Lookahead Branching for Mixed Integer Programming
Wasu Glankwamdee, Jeff Linderoth
On the complexity of cutting plane proofs using split cuts
Sanjeeb Dash
Approximate formulations for 0-1 knapsack sets
Daniel Bienstock
Linear, Cone and Semidefinite Programming
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
Alexandre Belloni, Robert M. Freund
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Alexandre Belloni, Robert M. Freund, Santosh Vempala
A Simpler and Tighter Redundant Klee-Minty Construction
Eissa Nematollahi, Tamas Terlaky
On the Copositive Representation of Binary and Continuous Nonconvex Quadratic Programs
Samuel Burer
A Matrix-lifting Semidefinite Relaxation for the Quadratic Assignment Problem
Yichuan Ding, Henry Wolkowicz
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
Christine Bachoc, Frank Vallentin
Nonlinear Optimization
A Brief History of Filter Methods
R Fletcher, S. Leyffer, Ph. L. Toint
Simplex-type algorithm for optimizing a pseudolinear quadratic fractional function over a polytope
Ujvári Miklós
Global Convergence of General Derivative-Free Trust-Region Algorithms to First and Second Order Critical Points
A. R. Conn, K. Scheinberg, L. N. Vicente
Using Simplex Gradients of Nonsmooth Functions in Direct Search Methods
A. L. Custódio, J. E. Dennis, L. N. Vicente
Robust Optimization
On Safe Tractable Approximations of Chance Constrained Linear Matrix Inequalities
Aharon Ben-Tal, Arkadi Nemirovski
Stochastic Programming
Asymptotics of minimax stochastic programs
Alexander Shapiro
|