Journal: Math. Oper. Res.

Volume 35, Issue 1

1 -- 13Shahar Dobzinski, Noam Nisan, Michael Schapira. Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
14 -- 26Miguel A. Goberna, Tamás Terlaky, Maxim I. Todorov. Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions
27 -- 51Bernd Heidergott, Haralambie Leahu. Weak Differentiability of Product Measures
52 -- 78Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum. Accuracy Certificates for Computational Problems with Convex Structure
79 -- 101Barbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan. A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
102 -- 119Serguei Foss, Andrew Richards. On Sums of Conditionally Independent Subexponential Random Variables
120 -- 139Shu Lu. Variational Conditions Under the Constant Rank Constraint Qualification
140 -- 159Erhan Bayraktar, Masahiko Egami. On the One-Dimensional Optimal Switching Problem
160 -- 172Glenn Merlet. Memory Loss Property for Products of Random Matrices in the Max-Plus Algebra
173 -- 192Anna Bogomolnaia, Ron Holzman, Hervé Moulin. Sharing the Cost of a Capacity Network
193 -- 207János Flesch, J. Kuipers, Gijs Schoenmakers, Koos Vrieze. Subgame Perfection in Positive Recursive Games with Perfect Information
208 -- 232Simai He, Jiawei Zhang, Shuzhong Zhang. Bounding Probability of Small Deviation: A Fourth Moment Approach
233 -- 256Kent Andersen, Quentin Louveaux, Robert Weismantel. An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets