default search action
Mathematics of Operations Research, Volume 35
Volume 35, Number 1, February 2010
- Shahar Dobzinski, Noam Nisan, Michael Schapira:
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders. 1-13 - Miguel A. Goberna
, Tamás Terlaky
Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions. 14-26 - Bernd Heidergott
Weak Differentiability of Product Measures. 27-51 - Arkadi Nemirovski
Accuracy Certificates for Computational Problems with Convex Structure. 52-78 - Barbara M. Anthony
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems. 79-101 - Serguei Foss
On Sums of Conditionally Independent Subexponential Random Variables. 102-119 - Shu Lu:
Variational Conditions Under the Constant Rank Constraint Qualification. 120-139 - Erhan Bayraktar
On the One-Dimensional Optimal Switching Problem. 140-159 - Glenn Merlet:
Memory Loss Property for Products of Random Matrices in the Max-Plus Algebra. 160-172 - Anna Bogomolnaia, Ron Holzman, Hervé Moulin:
Sharing the Cost of a Capacity Network. 173-192 - János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze:
Subgame Perfection in Positive Recursive Games with Perfect Information. 193-207 - Simai He
Bounding Probability of Small Deviation: A Fourth Moment Approach. 208-232 - Kent Andersen, Quentin Louveaux, Robert Weismantel:
An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets. 233-256
Volume 35, Number 2, May 2010
- A. B. Dieker, Jon Warren:
Series Jackson Networks and Noncrossing Probabilities. 257-266 - Guy Kindler, Assaf Naor, Gideon Schechtman:
The UGC Hardness Threshold of the Lp Grothendieck Problem. 267-283 - Dimitris Bertsimas, Vineet Goyal:
On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems. 284-305 - Huizhen Yu
Error Bounds for Approximations from Projected Linear Equations. 306-329 - Vincenzo Bonifaci
Stackelberg Routing in Arbitrary Networks. 330-346 - Jim G. Dai
Customer Abandonment in Many-Server Queues. 347-362 - Dimitris Bertsimas, Dan Andrei Iancu, Pablo A. Parrilo
Optimality of Affine Policies in Multistage Robust Optimization. 363-394 - Paat Rusmevichientong, John N. Tsitsiklis:
Linearly Parameterized Bandits. 395-411 - Ning Cai, Nan Chen, Xiangwei Wan:
Occupation Times of Jump-Diffusion Processes with Double Exponential Jumps and the Pricing of Options. 412-437 - Hédy 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. 438-457 - Vijay V. Vazirani:
Spending Constraint Utilities with Applications to the Adwords Market. 458-478 - William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem. 479-493 - Samid Hoda, Andrew Gilpin, Javier Peña, Tuomas Sandholm:
Smoothing Techniques for Computing Nash Equilibria of Sequential Games. 494-512
Volume 35, Number 3, August 2010
- Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz:
Strategyproof Approximation of the Minimax on Networks. 513-526 - Avi Mandelbaum, Kavita Ramanan:
Directional Derivatives of Oblique Reflection Maps. 527-558 - Frank Thomas Seifried:
Optimal Investment for Worst-Case Crash Scenarios: A Martingale Approach. 559-579 - Dimitris Bertsimas, Xuan Vinh Doan, Karthik Natarajan
Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion. 580-602 - Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli:
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. 603-623 - Mathieu Faure, Gregory Roth:
Stochastic Approximations of Set-Valued Dynamical Systems: Convergence with Positive Probability to an Attractor. 624-640 - D. Leventhal, Adrian S. Lewis:
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning. 641-654 - Xujin Chen, Zhibin Chen, Wenan Zang:
A Unified Approach to Box-Mengerian Hypergraphs. 655-668 - Otis B. Jennings:
Averaging Principles for a Diffusion-Scaled, Heavy-Traffic Polling Station with K Job Classes. 669-703 - Amitabh Basu
Maximal Lattice-Free Convex Sets in Linear Subspaces. 704-720
Volume 35, Number 4, November 2010
- Shie Mannor
A Geometric Proof of Calibration. 721-727 - Michael R. Wagner:
Fully Distribution-Free Profit Maximization: The Inventory Management Case. 728-741 - János Flesch, Jeroen Kuipers, Ayala Mashiah-Yaakovi, Gijs Schoenmakers
Perfect-Information Games with Lower-Semicontinuous Payoffs. 742-755 - Savas Dayanik:
Wiener Disorder Problem with Observations at Fixed Discrete Time Epochs. 756-785 - Friedrich Eisenbrand, Nicolai Hähnle, Alexander A. Razborov, Thomas Rothvoß:
Diameter of Polyhedra: Limits of Abstraction. 786-794 - Jon Lee
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. 795-806 - Predrag R. Jelenkovic, Jian Tan:
Modulated Branching Processes, Origins of Power Laws, and Queueing Duality. 807-829 - Haolin Feng
A Computational Method for Stochastic Impulse Control Problems. 830-850 - Bernard De Meyer, Ehud Lehrer, Dinah Rosenberg:
Evaluating Information in Zero-Sum Games with Incomplete Information on Both Sides. 851-863 - Xiaojin Zheng, Xiaoling Sun, Duan Li
Duality Gap Estimation of Linear Equality Constrained Binary Quadratic Programming. 864-880 - Vijay G. Subramanian
Large Deviations of Max-Weight Scheduling Policies on Convex Rate Regions. 881-910
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: