default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 34
Volume 34, Number 1, February 2009
- Aharon Ben-Tal, Arkadi Nemirovski
:
On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities. 1-25 - Kevin D. Glazebrook, R. J. Minty:
A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements. 26-44 - Amarjit Budhiraja, Chihoon Lee:
Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic. 45-56 - Wojciech Olszewski, Alvaro Sandroni:
Strategic Manipulation of Empirical Tests. 57-70 - Nelly Litvak, Vladimir Ejov:
Markov Chains and Optimality of the Hamiltonian Cycle. 71-82 - Werner Schachinger, Immanuel M. Bomze:
A Conic Duality Frank-Wolfe-Type Theorem via Exact Penalization in Quadratic Optimization. 83-91 - Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Online Scheduling with Known Arrival Times. 92-102 - Woonghee Tim Huh, Paat Rusmevichientong:
A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand. 103-123 - Houduo Qi:
Local Duality of Nonlinear Semidefinite Programming. 124-141 - Ramandeep S. Randhawa, Sunil Kumar:
Multiserver Loss Systems with Subscribers. 142-179 - Yurii E. Nesterov:
Unconstrained Convex Minimization in Relative Scale. 180-193 - Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey:
Network Formulations of Mixed-Integer Programs. 194-209 - Juliana M. Nascimento, Warren B. Powell:
An Optimal Approximate Dynamic Programming Algorithm for the Lagged Asset Acquisition Problem. 210-237 - José R. Correa, Asaf Levin:
Monotone Covering Problems with an Additional Covering Constraint. 238-248 - Manuel Klein:
Comment on "Investment Timing Under Incomplete Information". 249-254 - Jean-Paul Décamps, Thomas Mariotti, Stéphane Villeneuve:
Investment Timing Under Incomplete Information: Erratum. 255-256
Volume 34, Number 2, May 2009
- Jean-François Mertens, Abraham Neyman, Dinah Rosenberg:
Absorbing Games with Compact Action Spaces. 257-262 - Josef Hofbauer, Sylvain Sorin, Yannick Viossat:
Time Average Replicator and Best-Reply Dynamics. 263-269 - Niv Buchbinder, Joseph Naor:
Online Primal-Dual Algorithms for Covering and Packing. 270-286 - Vikram Krishnamurthy, Bo Wahlberg:
Partially Observed Markov Decision Process Multiarmed Bandits - Structural Results. 287-302 - Alfred Auslender, Miguel A. Goberna, Marco A. López:
Penalty and Smoothing Methods for Convex Semi-Infinite Programming. 303-319 - Xin Guo, Robert A. Jarrow, Yan Zeng:
Credit Risk Models with Incomplete Information. 320-332 - Carri W. Chan, Vivek F. Farias:
Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems. 333-350 - Kenjiro Takazawa:
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs. 351-362 - Itay Gurvich, Ward Whitt:
Queue-and-Idleness-Ratio Controls in Many-Server Service Systems. 363-396 - Woonghee Tim Huh, Ganesh Janakiraman, John A. Muckstadt, Paat Rusmevichientong:
An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand. 397-416 - Viswanath Nagarajan, Maxim Sviridenko:
Tight Bounds for Permutation Flow Shop Scheduling. 417-427 - Daniel Kuhn:
An Information-Based Approximation Scheme for Stochastic Optimization Problems in Continuous Time. 428-444 - Bogdan Grechuk, Anton Molyboha, Michael Zabarankin:
Maximum Entropy Principle with General Deviation Measures. 445-467 - Justin Salez, Devavrat Shah:
Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem. 468-480 - Peter Sanders, Naveen Sivadasan, Martin Skutella:
Online Scheduling with Bounded Migration. 481-498 - Nadine Baumann, Martin Skutella:
Earliest Arrival Flows with Multiple Sources. 499-512
Volume 34, Number 3, August 2009
- Satoru Fujishige, Kiyohito Nagano:
A Structure Theory for the Parametric Submodular Intersection Problem. 513-521 - Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye:
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level. 522-537 - Valentin Borozan, Gérard Cornuéjols:
Minimal Valid Inequalities for Integer Constraints. 538-546 - Masakiyo Miyazawa:
Tail Decay Rates in Double QBD Processes and Related Reflected Random Walks. 547-575 - Roberto Cominetti, Adriana Piazza:
Asymptotic Convergence of Optimal Policies for Resource Management with Application to Harvesting of Multiple Species Forest. 576-593 - Anke van Zuylen, David P. Williamson:
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems. 594-620 - Alexandre Belloni, Robert M. Freund, Santosh S. Vempala:
An Efficient Rescaled Perceptron Algorithm for Conic Systems. 621-641 - Paul Dupuis, Kevin Leder, Hui Wang:
Importance Sampling for Weighted-Serve-the-Longest-Queue. 642-660 - Roee Teper:
Time Continuity and Nonadditive Expected Utility. 661-673 - Nir Halman, Diego Klabjan, Mohamed Mostagir, James B. Orlin, David Simchi-Levi:
A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand. 674-685 - Yuri Faenza, Volker Kaibel:
Extended Formulations for Packing and Partitioning Orbitopes. 686-697 - Iskander Aliev, Martin Henk:
Integer Knapsacks: Average Behavior of the Frobenius Numbers. 698-705 - Michal Penn, Maria Polukarov, Moshe Tennenholtz:
Random Order Congestion Games. 706-725 - Eyal Even-Dar, Sham M. Kakade, Yishay Mansour:
Online Markov Decision Processes. 726-736 - Jia Yuan Yu, Shie Mannor, Nahum Shimkin:
Markov Decision Processes with Arbitrary Reward Processes. 737-757 - Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Giang T. Nguyen:
Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem. 758-768
Volume 34, Number 4, November 2009
- Pierre Cardaliaguet, Catherine Rainer:
On a Continuous-Time Game with Incomplete Information. 769-794 - Rami Atar, Avi Mandelbaum, Gennady Shaikhet:
Simplified Control Problems for Multiclass Many-Server Queueing Systems. 795-812 - Anna Galluccio, Claudio Gentile, Paolo Ventura:
Gear Composition of Stable Set Polytopes and G-Perfection. 813-836 - Rafael Blanquero, Emilio Carrizosa, Pierre Hansen:
Locating Objects in the Plane Using Global Optimization Techniques. 837-858 - Viswanath Nagarajan, Maxim Sviridenko:
On the Maximum Quadratic Assignment Problem. 859-868 - Robert M. Freund, Jorge R. Vera:
Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model. 869-879 - Douglas G. Down, H. Christian Gromoll, Amber L. Puha:
Fluid Limits for Shortest Remaining Processing Time Queues. 880-911 - Mustafa Akan, Baris Ata:
Bid-Price Controls for Network Revenue Management: Martingale Characterization of Optimal Bid Prices. 912-936 - Jiheng Zhang, Jim G. Dai, Bert Zwart:
Law of Large Number Limits of Limited Processor-Sharing Queues. 937-970 - Ronen Gradwohl, Omer Reingold, Ariel Yadin, Amir Yehudayoff:
Players' Effects Under Limited Independence. 971-980 - Walter Kern, Daniël Paulusma:
On the Core and f-Nucleolus of Flow Games. 981-991 - Alexander Zadorojniy, Guy Even, Adam Shwartz:
A Strongly Polynomial Algorithm for Controlled Queues. 992-1007 - Yichuan Ding, Henry Wolkowicz:
A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem. 1008-1022
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-10-22 02:14 CEST 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:
