Journal: Math. Oper. Res.

Volume 35, Issue 4

721 -- 727Shie Mannor, Gilles Stoltz. A Geometric Proof of Calibration
728 -- 741Michael R. Wagner. Fully Distribution-Free Profit Maximization: The Inventory Management Case
742 -- 755János Flesch, Jeroen Kuipers, Ayala Mashiah-Yaakovi, Gijs Schoenmakers, Eilon Solan, Koos Vrieze. Perfect-Information Games with Lower-Semicontinuous Payoffs
756 -- 785Savas Dayanik. Wiener Disorder Problem with Observations at Fixed Discrete Time Epochs
786 -- 794Friedrich Eisenbrand, Nicolai Hähnle, Alexander A. Razborov, Thomas Rothvoß. Diameter of Polyhedra: Limits of Abstraction
795 -- 806Jon Lee, Maxim Sviridenko, Jan Vondrák. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
807 -- 829Predrag R. Jelenkovic, Jian Tan. Modulated Branching Processes, Origins of Power Laws, and Queueing Duality
830 -- 850Haolin Feng, Kumar Muthuraman. A Computational Method for Stochastic Impulse Control Problems
851 -- 863Bernard De Meyer, Ehud Lehrer, Dinah Rosenberg. Evaluating Information in Zero-Sum Games with Incomplete Information on Both Sides
864 -- 880Xiaojin Zheng, Xiaoling Sun, Duan Li, Yong Xia. Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming
881 -- 910Vijay G. Subramanian. Large Deviations of Max-Weight Scheduling Policies on Convex Rate Regions

Volume 35, Issue 3

513 -- 526Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz. Strategyproof Approximation of the Minimax on Networks
527 -- 558Avi Mandelbaum, Kavita Ramanan. Directional Derivatives of Oblique Reflection Maps
559 -- 579Frank Thomas Seifried. Optimal Investment for Worst-Case Crash Scenarios: A Martingale Approach
580 -- 602Dimitris Bertsimas, Xuan Vinh Doan, Karthik Natarajan, Chung-Piaw Teo. Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion
603 -- 623Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli. Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs
624 -- 640Mathieu Faure, Gregory Roth. Stochastic Approximations of Set-Valued Dynamical Systems: Convergence with Positive Probability to an Attractor
641 -- 654D. Leventhal, A. S. Lewis. Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
655 -- 668Xujin Chen, Zhibin Chen, Wenan Zang. A Unified Approach to Box-Mengerian Hypergraphs
669 -- 703Otis B. Jennings. Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with ::::K:::: Job Classes
704 -- 720Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli. Maximal Lattice-Free Convex Sets in Linear Subspaces

Volume 35, Issue 2

257 -- 266A. B. Dieker, J. Warren. Series Jackson Networks and Noncrossing Probabilities
267 -- 283Guy Kindler, Assaf Naor, Gideon Schechtman. The UGC Hardness Threshold of the ::::L::p:::::: Grothendieck Problem
284 -- 305Dimitris Bertsimas, Vineet Goyal. On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
306 -- 329Huizhen Yu, Dimitri P. Bertsekas. Error Bounds for Approximations from Projected Linear Equations
330 -- 346Vincenzo Bonifaci, Tobias Harks, Guido Schäfer. Stackelberg Routing in Arbitrary Networks
347 -- 362J. G. Dai, Shuangchi He. Customer Abandonment in Many-Server Queues
363 -- 394Dimitris Bertsimas, Dan Andrei Iancu, Pablo A. Parrilo. Optimality of Affine Policies in Multistage Robust Optimization
395 -- 411Paat Rusmevichientong, John N. Tsitsiklis. Linearly Parameterized Bandits
412 -- 437Ning Cai, Nan Chen, Xiangwei Wan. Occupation Times of Jump-Diffusion Processes with Double Exponential Jumps and the Pricing of Options
438 -- 457Hedy Attouch, Jérôme Bolte, Patrick Redont, Antoine Soubeyran. Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality
458 -- 478Vijay V. Vazirani. Spending Constraint Utilities with Applications to the Adwords Market
479 -- 493William J. Cook, Daniel G. Espinoza, Marcos Goycoolea. Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
494 -- 512Samid Hoda, Andrew Gilpin, Javier Peña, Tuomas Sandholm. Smoothing Techniques for Computing Nash Equilibria of Sequential Games

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