Sciweavers

MP
2007
145views more  MP 2007»
13 years 11 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
MP
2007
95views more  MP 2007»
13 years 11 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
MP
2007
75views more  MP 2007»
13 years 11 months ago
Solving maximum-entropy sampling problems using factored masks
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
Samuel Burer, Jon Lee
MP
2007
76views more  MP 2007»
13 years 11 months ago
Universal duality in conic convex optimization
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
Simon P. Schurr, André L. Tits, Dianne P. O...
MP
2007
136views more  MP 2007»
13 years 11 months ago
Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is a higher-dimensional version of the Linear Assignment Problem that arises in the areas of data association, target tracking, resou...
Pavlo A. Krokhmal, Don A. Grundel, Panos M. Pardal...
MP
2007
75views more  MP 2007»
13 years 11 months ago
Large-scale semidefinite programming via a saddle point Mirror-Prox algorithm
Zhaosong Lu, Arkadi Nemirovski, Renato D. C. Monte...
MP
2007
89views more  MP 2007»
13 years 11 months ago
Globally convergent limited memory bundle method for large-scale nonsmooth optimization
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...
Napsu Haarala, Kaisa Miettinen, Marko M. Mäke...
MP
2007
100views more  MP 2007»
13 years 11 months ago
Mixed-Integer Cuts from Cyclic Groups
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
Matteo Fischetti, Cristiano Saturni
MP
2007
89views more  MP 2007»
13 years 11 months ago
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
Let Bi be deterministic real symmetric m × m matrices, and ξi be independent random scalars with zero mean and “of order of one” (e.g., ξi ∼ N(0, 1)). We are interested to...
Arkadi Nemirovski