default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 39
Volume 39, Number 1, February 2014
- Mengdi Wang
, Dimitri P. Bertsekas:
Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems. 1-30 - Jean-Yves Audibert, Sébastien Bubeck, Gábor Lugosi:
Regret in Online Combinatorial Optimization. 31-45 - Marco Molinaro, R. Ravi:
The Geometry of Online Packing Linear Programs. 46-59 - Hiroshi Hirai:
The Maximum Multiflow Problems with Bounded Fractionality. 60-104 - Nicole Bäuerle, Ulrich Rieder:
More Risk-Sensitive Markov Decision Processes. 105-120 - Itai Gurvich:
Validity of Heavy-Traffic Steady-State Approximations in Multiclass Queueing Networks: The Case of Queue-Ratio Disciplines. 121-162 - Jingchen Wu, Xiuli Chao:
Optimal Control of a Brownian Production/Inventory System with Average Cost Criterion. 163-189 - Niv Buchbinder, Kamal Jain, Mohit Singh:
Secretary Problems via Linear Programming. 190-206 - Ananda P. Weerasinghe:
Diffusion Approximations for G/M/n + GI Queues with State-Dependent Service Rates. 207-228
Volume 39, Number 2, May 2014
- David Gamarnik, David A. Goldberg, Theophane Weber:
Correlation Decay in Random Decision Networks. 229-261 - Amarjit Budhiraja, Jiang Chen, Sylvain Rubenthaler:
A Numerical Scheme for Invariant Distributions of Constrained Diffusions. 262-289 - Shiri Alon:
Derivation of a Cardinal Utility Through a Weak Trade-off Consistency Requirement. 290-300 - Boris S. Mordukhovich, Tran T. A. Nghia:
Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming. 301-324 - Itai Gurvich, Junfei Huang, Avishai Mandelbaum:
Excursion-Based Universal Approximations for the Erlang-A Queue in Steady-State. 325-373 - Daniel Adelman, Christiane Barz:
A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem. 374-402 - Frans Schalekamp, David P. Williamson, Anke van Zuylen:
2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture. 403-417 - Matthieu Jonckheere, Sergio López:
Large Deviations for the Stationary Measure of Networks Under Proportional Fair Allocations. 418-431 - Danny Segev:
An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem. 432-444 - Elena Antoniadou, Leonard J. Mirman, Richard Ruble:
Lattices and Lotteries. 445-463 - Bernt Øksendal, Agnès Sulem, Tusheng Zhang:
Singular Control and Optimal Stopping of SPDEs, and Backward SPDEs with Reflection. 464-486 - Chenxu Li:
Closed-Form Expansion, Conditional Expectation, and Option Valuation. 487-516 - Nicky D. van Foreest, Jacob Wijngaard:
On Optimal Policies for Production-Inventory Systems with Compound Poisson Demand and Setup Costs. 517-532 - Sem C. Borst, Regina Egorova, Bert Zwart:
Fluid Limits for Bandwidth-Sharing Networks in Overload. 533-560 - Neil Olver, F. Bruce Shepherd:
Approximability of Robust Network Design. 561-572 - László A. Végh:
Concave Generalized Flows with Applications to Market Equilibria. 573-596
Volume 39, Number 3, August 2014
- B. Curtis Eaves, Arthur F. Veinott Jr.:
Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains. 597-606 - B. Curtis Eaves, Uriel G. Rothblum:
An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms. 607-623 - Patrick Jaillet, Xin Lu:
Online Stochastic Matching: New Algorithms with Better Bounds. 624-646 - Donald G. Saari:
A New Way to Analyze Paired Comparison Rules. 647-655 - Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis:
Polyhedral Aspects of Stable Marriage. 656-671 - Rami Atar, Haya Kaspi, Nahum Shimkin:
Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy. 672-696 - Steve Alpern, Thomas Lidbetter:
Searching a Variable Speed Network. 697-711 - Miquel Oliu-Barton:
The Asymptotic Value in Finite Stochastic Games. 712-721 - Ning Chen, Nick Gravin, Pinyan Lu:
Truthful Generalized Assignments via Stable Matching. 722-736 - Efe A. Ok, Gil Riella:
Topological Closure of Translation Invariant Preorders. 737-745 - Maria Remerova, Josh Reed, Bert Zwart:
Fluid Limits for Bandwidth-Sharing Networks with Rate Constraints. 746-774 - Bo Jiang, Simai He, Zhening Li, Shuzhong Zhang:
Moments Tensors, Hilbert's Identity, and k-wise Uncorrelated Random Variables. 775-788 - Ning Cai, Chenxu Li, Chao Shi:
Closed-Form Expansions of Discretely Monitored Asian Options in Diffusion Models. 789-822 - Karen I. Aardal, Frederik von Heymann:
On the Structure of Reduced Kernel Lattice Bases. 823-840 - Roland Hildebrand:
Canonical Barriers on Convex Cones. 841-850 - Naoyuki Kamiyama:
A New Approach to the Pareto Stable Matching Problem. 851-862 - Arnoud V. den Boer:
Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution. 863-888 - Simai He, Bo Jiang, Zhening Li, Shuzhong Zhang:
Probability Bounds for Polynomial Functions in Random Variables. 889-907 - Anup Biswas:
Risk-Sensitive Control for the Multiclass Many-Server Queues in the Moderate Deviation Regime. 908-929 - Yanjun Li:
The Nonnegative Node Weight j-Restricted k-Matching Problems. 930-948
Volume 39, Number 4, November 2014
- Lars Ehlers, Bettina Klaus:
Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities. 949-966 - Gábor Bartók, Dean P. Foster, Dávid Pál, Alexander Rakhlin, Csaba Szepesvári:
Partial Monitoring - Classification, Regret Bounds, and Algorithms. 967-997 - Anupam Gupta, Viswanath Nagarajan:
Approximating Sparse Covering Integer Programs Online. 998-1011 - Chaithanya Bandi, Dimitris Bertsimas:
Optimal Design for Multi-Item Auctions: A Robust Optimization Approach. 1012-1038 - Van-Anh Truong:
Approximation Algorithm for the Stochastic Multiperiod Inventory Problem via a Look-Ahead Optimization Approach. 1039-1056 - Andrey Bernstein, Shie Mannor, Nahum Shimkin:
Opportunistic Approachability and Generalized No-Regret Problems. 1057-1083 - Ke Hou, Anthony Man-Cho So:
Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems. 1084-1108 - Roger J. A. Laeven, Mitja Stadje:
Robust Portfolio Choice and Indifference Valuation. 1109-1141 - Jose H. Blanchet, Henry Lam:
Rare-Event Simulation for Many-Server Queues. 1142-1178 - Zhijie Tao, Sean X. Zhou:
Approximation Balancing Policies for Inventory Systems with Remanufacturing. 1179-1197 - Peter Kratz:
An Explicit Solution of a Nonlinear-Quadratic Constrained Stochastic Control Problem with Jumps: Optimal Liquidation in Dark Pools with Adverse Selection. 1198-1220 - Daniel Russo, Benjamin Van Roy:
Learning to Optimize via Posterior Sampling. 1221-1243 - Dongdong Ge, Guohua Wan, Zizhuo Wang, Jiawei Zhang:
A Note on Appointment Scheduling with Piecewise Linear Cost Functions. 1244-1251 - Ragavendran Gopalakrishnan, Jason R. Marden, Adam Wierman:
Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games. 1252-1296 - Nicole Megow, Tjark Vredeveld:
A Tight 2-Approximation for Preemptive Stochastic Scheduling. 1297-1310 - Endre Boros, Andrea Scozzari, Fabio Tardella, Pierangela Veneziani:
Polynomially Computable Bounds for the Probability of the Union of Events. 1311-1329 - Kanstantsin Pashkovich:
Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results. 1330-1339 - Karim A. Adiprasito, Bruno Benedetti:
The Hirsch Conjecture Holds for Normal Flag Complexes. 1340-1348
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 2025-11-18 22:33 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:
