INFORMS
Mathematics of Operations Research
Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
Phone: +1-443-757-3500
Fax: 443-757-3515
Web page: http://www.informs.org/
Email:
More information through EDIRC
Phone: +1-443-757-3500
Fax: 443-757-3515
Web page: http://www.informs.org/
Email:
More information through EDIRC
For corrections or technical questions regarding this series, please contact (Mirko Janc)
Series handle: repec:inm:ormoor
ISSN: 0364-765X
Citations RSS feed: at CitEc
Top item:
ISSN: 0364-765X
Citations RSS feed: at CitEc
Impact factors
- Simple (last 10 years)
- Recursive (10)
- Discounted (10)
- Recursive discounted (10)
- H-Index (10)
- Euclid (10)
- Aggregate (10)
Top item:
- By citations
- By downloads (last 12 months)
January 2017, Volume 42, Issue 1
- 1-14 When Is a Network Epidemic Hard to Eliminate?
by Kimon Drakopoulos & Asuman Ozdaglar & John N. Tsitsiklis - 15-29 Empirical Distribution of Equilibrium Play and Its Testing Application
by Yakov Babichenko & Siddharth Barman & Ron Peretz - 30-56 Robust Optimization of Credit Portfolios
by Lijun Bo & Agostino Capponi - 57-76 Constructing New Weighted ℓ 1 -Algorithms for the Sparsest Points of Polyhedral Sets
by Yun-Bin Zhao & Zhi-Quan Luo - 77-94 Genericity Results in Linear Conic Programming—A Tour d’Horizon
by Mirjam Dür & Bolor Jargalsaikhan & Georg Still - 95-118 Computing B-Stationary Points of Nonsmooth DC Programs
by Jong-Shi Pang & Meisam Razaviyayn & Alberth Alvarado - 119-134 Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization
by Alexander Engau - 135-143 On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
by Adam Kurpisz & Samuli Leppänen & Monaldo Mastrolilli - 144-166 Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
by Stephen R. Chestnut & Rico Zenklusen - 167-178 Characterizations of Smooth Ambiguity Based on Continuous and Discrete Data
by Stefania Minardi & Andrei Savochkin - 179-211 A Strongly Polynomial Algorithm for Generalized Flow Maximization
by László A. Végh - 212-237 Inventory Control for Spectrally Positive Lévy Demand Processes
by Kazutoshi Yamazaki - 238-255 A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
by Yu Yokoi - 256-276 Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models
by Retsef Levi & Robin Roundy & Van Anh Truong & Xinshang Wang
November 2016, Volume 41, Issue 4
- 1161-1207 Diffusion Limit of Fair Resource Control—Stationarity and Interchange of Limits
by Heng-Qing Ye & David D. Yao - 1208-1221 Subgame-Perfect ϵ-Equilibria in Perfect Information Games with Common Preferences at the Limit
by János Flesch & Arkadi Predtetchinski - 1222-1247 Optimality of Quasi-Open-Loop Policies for Discounted Semi-Markov Decision Processes
by Daniel Adelman & Angelo J. Mancini - 1248-1275 Robust Sensitivity Analysis for Stochastic Systems
by Henry Lam - 1276-1296 Optimality of Mixed Policies for Average Continuous-Time Markov Decision Processes with Constraints
by Xianping Guo & Yi Zhang - 1297-1324 Learning in Games via Reinforcement and Regularization
by Panayotis Mertikopoulos & William H. Sandholm - 1325-1353 Reinforcement Learning in Robust Markov Decision Processes
by Shiau Hong Lim & Huan Xu & Shie Mannor - 1354-1380 A Differential Game for a Multiclass Queueing Model in the Moderate-Deviation Heavy-Traffic Regime
by Rami Atar & Asaf Cohen - 1381-1403 Cut-Generating Functions for Integer Variables
by Sercan Yıldız & Gérard Cornuéjols - 1404-1431 How the Experts Algorithm Can Help Solve LPs Online
by Anupam Gupta & Marco Molinaro - 1432-1447 Finite-Horizon Optimal Multiple Switching with Signed Switching Costs
by Randall Martyr - 1448-1468 A Central Limit Theorem for Temporally Nonhomogenous Markov Chains with Applications to Dynamic Programming
by Alessandro Arlotto & J. Michael Steele - 1469-1483 An Adjusted Payoff-Based Procedure for Normal Form Games
by Mario Bravo - 1484-1509 Robust MDPs with k -Rectangular Uncertainty
by Shie Mannor & Ofir Mebel & Huan Xu - 1510-1521 Additive Consistency of Risk Measures and Its Application to Risk-Averse Routing in Networks
by Roberto Cominetti & Alfredo Torrico - 1522-1534 A Tauberian Theorem for Nonexpansive Operators and Applications to Zero-Sum Stochastic Games
by Bruno Ziliotto - 1535-1556 On Computation of Generalized Derivatives of the Normal-Cone Mapping and Their Applications
by Helmut Gfrerer & Jiří V. Outrata
August 2016, Volume 41, Issue 3
- 745-757 An Improved Integrality Gap for Asymmetric TSP Paths
by Zachary Friggstad & Anupam Gupta & Mohit Singh - 758-774 Improved and Generalized Upper Bounds on the Complexity of Policy Iteration
by Bruno Scherrer - 775-807 Approximations for Chat Service Systems Using Many-Server Diffusion Limits
by Leon Cui & Tolga Tezcan - 808-826 Joint Mixability
by Bin Wang & Ruodu Wang - 827-850 Sequential Sensor Installation for Wiener Disorder Detection
by Savas Dayanik & Semih O. Sezer - 851-864 Unrelated Machine Scheduling with Stochastic Processing Times
by Martin Skutella & Maxim Sviridenko & Marc Uetz - 865-883 Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems
by Deeparnab Chakrabarty & Chaitanya Swamy - 884-897 On the Range of the Douglas–Rachford Operator
by Heinz H. Bauschke & Warren L. Hare & Walaa M. Moursi - 898-913 Asymptotic Optimality of Constant-Order Policies for Lost Sales Inventory Models with Large Lead Times
by David A. Goldberg & Dmitriy A. Katz-Rogozhnikov & Yingdong Lu & Mayank Sharma & Mark S. Squillante - 914-934 Multivariate Transient Price Impact and Matrix-Valued Positive Definite Functions
by Aurélien Alfonsi & Florian Klöck & Alexander Schied - 935-952 Recursive Inspection Games
by Bernhard von Stengel - 953-968 Optimal Consumption Until Ruin for an Endowment Described by an Autonomous ODE for an Infinite Time Horizon
by Peter Grandits - 969-990 A Polyhedral Description of Kernels
by Qin Chen & Xujin Chen & Wenan Zang - 991-1021 Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
by Martin Skutella & José Verschae - 1022-1038 Submodular Stochastic Probing on Matroids
by Marek Adamczyk & Maxim Sviridenko & Justin Ward - 1039-1054 Fundamental Theorem of Asset Pricing Under Transaction Costs and Model Uncertainty
by Erhan Bayraktar & Yuchong Zhang - 1055-1092 Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues
by Łukasz Kruk & Ewa Sokołowska - 1093-1107 Continuous Time Contests with Private Information
by Christian Seel & Philipp Strack - 1108-1124 Bayesian Switching Multiple Disorder Problems
by Pavel V. Gapeev - 1125-1134 Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
by Michael J. Todd - 1135-1160 A Unified Approach to Diffusion Analysis of Queues with General Patience-Time Distributions
by Junfei Huang & Hanqin Zhang & Jiheng Zhang
May 2016, Volume 41, Issue 2
- 377-401 Convergence Analysis for Distributionally Robust Optimization and Equilibrium Problems
by Hailin Sun & Huifu Xu - 402-429 Empirical Dynamic Programming
by William B. Haskell & Rahul Jain & Dileep Kalathil - 430-441 Stationary Almost Markov Perfect Equilibria in Discounted Stochastic Games
by Anna Jaśkiewicz & Andrzej S. Nowak - 442-465 Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
by Jérôme Bolte & Edouard Pauwels - 466-476 Local Utility and Multivariate Risk Aversion
by Arthur Charpentier & Alfred Galichon & Marc Henry - 477-510 On Minimal Valid Inequalities for Mixed Integer Conic Programs
by Fatma Kılınç-Karzan - 511-530 Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
by Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer - 531-559 General Optimized Lower and Upper Bounds for Discrete and Continuous Arithmetic Asian Options
by Gianluca Fusai & Ioannis Kyriakou - 560-595 Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic
by Hongyuan Lu & Guodong Pang - 596-611 Hölder-Like Property and Metric Regularity of a Positive-Order for Implicit Multifunctions
by Thai Doan Chuong & Do Sang Kim - 612-625 Unified Algorithms for Online Learning and Competitive Analysis
by Niv Buchbinder & Shahar Chen & Joseph (Seffi) Naor & Ohad Shamir - 626-642 Optimal Trend Following Trading Rules
by Min Dai & Zhou Yang & Qing Zhang & Qiji Jim Zhu - 643-647 HodgeRank Is the Limit of Perron Rank
by Ngoc Mai Tran - 648-655 Zero-Sum Polymatrix Games: A Generalization of Minmax
by Yang Cai & Ozan Candogan & Constantinos Daskalakis & Christos Papadimitriou - 656-681 Partially Observable Total-Cost Markov Decision Processes with Weakly Continuous Transition Probabilities
by Eugene A. Feinberg & Pavlo O. Kasyanov & Michael Z. Zgurovsky - 682-699 Time-Consistent Decisions and Temporal Decomposition of Coherent Risk Functionals
by Georg Ch. Pflug & Alois Pichler - 700-714 Lower Bounds for Bruss’ Odds Problem with Multiple Stoppings
by Tomomi Matsui & Katsunori Ano - 715-731 Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints
by Kunikazu Yoda & András Prékopa - 732-733 Erratum: “Convex Duality in Stochastic Optimization and Mathematical Finance”
by Teemu Pennanen - 734-744 A Matroid Approach to Stable Matchings with Lower Quotas
by Tamás Fleiner & Naoyuki Kamiyama
February 2016, Volume 41, Issue 1
- 1-22 Two-Stage Optimization Problems with Multivariate Stochastic Order Constraints
by Darinka Dentcheva & Eli Wolfhagen - 23-48 The Cutting Plane Method is Polynomial for Perfect Matchings
by Karthekeyan Chandrasekaran & László A. Végh & Santosh S. Vempala - 49-71 Markov Games with Frequent Actions and Incomplete Information—The Limit Case
by Pierre Cardaliaguet & Catherine Rainer & Dinah Rosenberg & Nicolas Vieille - 72-91 On a Piecewise-Linear Approximation for Network Revenue Management
by Sumit Kunnumkal & Kalyan Talluri - 92-108 Finitely Additive Dynamic Programming
by William D. Sudderth - 109-124 Stochastic Target Games and Dynamic Programming via Regularized Viscosity Solutions
by Bruno Bouchard & Marcel Nutz - 125-145 Optimal Transport and Cournot-Nash Equilibria
by Adrien Blanchet & Guillaume Carlier - 146-173 Maximization of Nonconcave Utility Functions in Discrete-Time Financial Market Models
by Laurence Carassus & Miklós Rásonyi - 174-195 Equilibrium Pricing in Incomplete Markets Under Translation Invariant Preferences
by Patrick Cheridito & Ulrich Horst & Michael Kupper & Traian A. Pirvu - 196-223 On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
by Amir Beck & Nadav Hallak - 224-235 A Characterization of the Optimal Certainty Equivalent of the Average Cost via the Arrow-Pratt Sensitivity Function
by Rolando Cavazos-Cadena & Daniel Hernández-Hernández - 236-246 On the Tail Probabilities of Aggregated Lognormal Random Fields with Small Noise
by Xiaoou Li & Jingchen Liu & Gongjun Xu - 247-254 No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem
by Marcin Mucha & Maxim Sviridenko - 255-277 Congestion Games with Variable Demands
by Tobias Harks & Max Klimm - 278-292 Where Strategic and Evolutionary Stability Depart—A Study of Minimal Diversity Games
by Dieter Balkenborg & Dries Vermeulen - 293-317 A Measure-Valued Differentiation Approach to Sensitivities of Quantiles
by Bernd Heidergott & Warren Volk-Makarewicz - 318-331 Capacitated Vehicle Routing with Nonuniform Speeds
by Inge Li Gørtz & Marco Molinaro & Viswanath Nagarajan & R. Ravi - 332-351 A Unified Approach to Truthful Scheduling on Related Machines
by Leah Epstein & Asaf Levin & Rob van Stee - 352-376 Optimal Provision-After-Wait in Healthcare
by Mark Braverman & Jing Chen & Sampath Kannan
October 2015, Volume 40, Issue 4
- 797-819 Affine Point Processes: Approximation and Efficient Simulation
by Xiaowei Zhang & Jose Blanchet & Kay Giesecke & Peter W. Glynn - 820-841 The Value of Markov Chain Games with Incomplete Information on Both Sides
by Fabien Gensbittel & Jérôme Renault - 842-858 A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming
by Min Li & Xiaoming Yuan - 859-868 The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes
by Ian Post & Yinyu Ye - 869-887 Game of Singular Stochastic Control and Strategic Exit
by H. Dharma Kwon & Hongzhong Zhang - 888-901 Stochastic Billiards for Sampling from the Boundary of a Convex Set
by A. B. Dieker & Santosh S. Vempala - 902-914 Entrepreneurial Decisions on Effort and Project with a Nonconcave Objective Function
by Alain Bensoussan & Abel Cadenillas & Hyeng Keun Koo - 915-925 Sharp Thresholds for Monotone Non-Boolean Functions and Social Choice Theory
by Gil Kalai & Elchanan Mossel - 926-968 A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies
by Huizhen Yu & Dimitri P. Bertsekas - 969-991 Directional Metric Regularity of Multifunctions
by Huynh Van Ngai & Michel Théra - 992-1004 Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars
by Petar Jevtić & J. Michael Steele - 1005-1014 The Complexity of Computing the Random Priority Allocation Matrix
by Daniela Saban & Jay Sethuraman - 1015-1026 The Linear Complementarity Problems with a Few Variables per Constraint
by Hanna Sumita & Naonori Kakimura & Kazuhisa Makino - 1027-1041 Analogy in Decision Making
by Massimiliano Amarante - 1042-1059 Portfolio Optimization with Quasiconvex Risk Measures
by Elisa Mastrogiacomo & Emanuela Rosazza Gianin - 1060-1088 Optimal Information Blending with Measurements in the L 2 Sphere
by Boris Defourny & Ilya O. Ryzhov & Warren B. Powell
March 2015, Volume 40, Issue 3
- 513-541 On Error Estimates for Asymptotic Expansions with Malliavin Weights: Application to Stochastic Volatility Model
by Akihiko Takahashi & Toshihiro Yamada - 542-557 From Cost Sharing Mechanisms to Online Selection Problems
by Adam N. Elmachtoub & Retsef Levi - 558-595 A Fair Policy for the G / GI / N Queue with Multiple Server Pools
by Josh Reed & Yair Shaki - 596-610 On a Unified Framework for Approachability with Full or Partial Monitoring
by Vianney Perchet & Marc Quincampoix - 611-633 Penalty-Regulated Dynamics and Robust Learning Procedures in Games
by Pierre Coucheney & Bruno Gaujal & Panayotis Mertikopoulos - 634-654 On the Uniqueness of Equilibrium in Atomic Splittable Routing Games
by Umang Bhaskar & Lisa Fleischer & Darrell Hoy & Chien-Chung Huang - 655-682 Tight Approximations of Dynamic Risk Measures
by Dan A. Iancu & Marek Petrik & Dharmashankar Subramanian - 683-702 Fluid Limits of G / G /1+ G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
by Rami Atar & Anup Biswas & Haya Kaspi - 703-724 Metric Subregularity of Multifunctions: First and Second Order Infinitesimal Characterizations
by Huynh Van Ngai & Phan Nhat Tinh - 725-738 New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
by Xin Chen & Jiming Peng - 739-755 Attainability in Repeated Games with Vector Payoffs
by Dario Bauso & Ehud Lehrer & Eilon Solan & Xavier Venel - 756-772 Approximation Limits of Linear Programs (Beyond Hierarchies)
by Gábor Braun & Samuel Fiorini & Sebastian Pokutta & David Steurer - 773-796 Dynamic Portfolio Choice When Risk Is Measured by Weighted VaR
by Xue Dong He & Hanqing Jin & Xun Yu Zhou
February 2015, Volume 40, Issue 2
- 253-275 The Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Complementarity Constraints Revisited
by Christian Kanzow & Alexandra Schwartz - 276-391 Cut-Generating Functions and S -Free Sets
by Michele Conforti & Gérard Cornuéjols & Aris Daniilidis & Claude Lemaréchal & Jérôme Malick - 302-327 Inventory Management with Stochastic Lead Times
by Kumar Muthuraman & Sridhar Seshadri & Qi Wu - 328-349 Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions
by Dmitriy Drusvyatskiy & Alexander D. Ioffe & Adrian S. Lewis - 350-360 Forbidden Vertices
by Gustavo Angulo & Shabbir Ahmed & Santanu S. Dey & Volker Kaibel - 361-389 Parameter Estimation: The Proper Way to Use Bayesian Posterior Processes with Brownian Noise
by Asaf Cohen - 390-402 A Fluid EOQ Model of Perishable Items with Intermittent High and Low Demand Rates
by Onno Boxma & David Perry & Shelley Zacks - 403-428 Commutative Stochastic Games
by Xavier Venel - 429-445 Equimeasurable Rearrangements with Capacities
by Mario Ghossoub - 446-459 Facility Location with Matroid or Knapsack Constraints
by Ravishankar Krishnaswamy & Amit Kumar & Viswanath Nagarajan & Yogish Sabharwal & Barna Saha - 460-473 On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market
by Kazuo Murota & Yu Yokoi - 474-494 On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms
by Aharon Ben-Tal & Arkadi Nemirovski - 495-512 K -Optimal Design via Semidefinite Programming and Entropy Optimization
by Pierre Maréchal & Jane J. Ye & Julie Zhou
February 2015, Volume 40, Issue 1
- 1-23 On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
by Cheng-Shang Chang & Wanjiun Liao & Ching-Min Lien - 24-55 Bifurcations of Optimal Vector Fields
by Tatiana Kiseleva & Florian Wagener - 56-79 Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
by Anupam Gupta & Ravishankar Krishnaswamy & Viswanath Nagarajan & R. Ravi - 80-104 Extensions of the Cav( u ) Theorem for Repeated Games with Incomplete Information on One Side
by Fabien Gensbittel - 105-129 Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case
by Amitabh Basu & Robert Hildebrand & Matthias Köppe - 130-145 On the Convergence of Decomposition Methods for Multistage Stochastic Convex Programs
by P. Girardeau & V. Leclere & A. B. Philpott - 146-170 Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming
by Amitabh Basu & Kipp Martin & Christopher Thomas Ryan - 171-191 Definable Zero-Sum Stochastic Games
by Jérôme Bolte & Stéphane Gaubert & Guillaume Vigeral - 192-225 Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints
by Akiyoshi Shioura - 226-252 Full Stability in Finite-Dimensional Optimization
by B. S. Mordukhovich & T. T. A. Nghia & R. T. Rockafellar
November 2014, Volume 39, Issue 4
- 949-966 Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities
by Lars Ehlers & Bettina Klaus - 967-997 Partial Monitoring---Classification, Regret Bounds, and Algorithms
by Gábor Bartók & Dean P. Foster & Dávid Pál & Alexander Rakhlin & Csaba Szepesvári - 998-1011 Approximating Sparse Covering Integer Programs Online
by Anupam Gupta & Viswanath Nagarajan - 1012-1038 Optimal Design for Multi-Item Auctions: A Robust Optimization Approach
by Chaithanya Bandi & Dimitris Bertsimas - 1039-1056 Approximation Algorithm for the Stochastic Multiperiod Inventory Problem via a Look-Ahead Optimization Approach
by Van-Anh Truong - 1057-1083 Opportunistic Approachability and Generalized No-Regret Problems
by Andrey Bernstein & Shie Mannor & Nahum Shimkin - 1084-1108 Hardness and Approximation Results for L p -Ball Constrained Homogeneous Polynomial Optimization Problems
by Ke Hou & Anthony Man-Cho So - 1109-1141 Robust Portfolio Choice and Indifference Valuation
by Roger J. A. Laeven & Mitja Stadje - 1142-1178 Rare-Event Simulation for Many-Server Queues
by Jose Blanchet & Henry Lam - 1179-1197 Approximation Balancing Policies for Inventory Systems with Remanufacturing
by Zhijie Tao & Sean X. Zhou - 1198-1220 An Explicit Solution of a Nonlinear-Quadratic Constrained Stochastic Control Problem with Jumps: Optimal Liquidation in Dark Pools with Adverse Selection
by Peter Kratz - 1221-1243 Learning to Optimize via Posterior Sampling
by Daniel Russo & Benjamin Van Roy - 1244-1251 A Note on Appointment Scheduling with Piecewise Linear Cost Functions
by Dongdong Ge & Guohua Wan & Zizhuo Wang & Jiawei Zhang - 1252-1296 Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
by Ragavendran Gopalakrishnan & Jason R. Marden & Adam Wierman - 1297-1310 A Tight 2-Approximation for Preemptive Stochastic Scheduling
by Nicole Megow & Tjark Vredeveld - 1311-1329 Polynomially Computable Bounds for the Probability of the Union of Events
by Endre Boros & Andrea Scozzari & Fabio Tardella & Pierangela Veneziani - 1330-1339 Tight Lower Bounds on the Sizes of Symmetric Extensions of Permutahedra and Similar Results
by Kanstantsin Pashkovich - 1340-1348 The Hirsch Conjecture Holds for Normal Flag Complexes
by Karim A. Adiprasito & Bruno Benedetti
August 2014, Volume 39, Issue 3
- 597-606 Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains
by B. Curtis Eaves & Arthur F. Veinott - 607-623 An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms
by B. Curtis Eaves & Uriel G. Rothblum - 624-646 Online Stochastic Matching: New Algorithms with Better Bounds
by Patrick Jaillet & Xin Lu - 647-655 A New Way to Analyze Paired Comparison Rules
by Donald G. Saari - 656-671 Polyhedral Aspects of Stable Marriage
by Pavlos Eirinakis & Dimitrios Magos & Ioannis Mourtos & Panayiotis Miliotis - 672-696 Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy
by Rami Atar & Haya Kaspi & Nahum Shimkin - 697-711 Searching a Variable Speed Network
by Steve Alpern & Thomas Lidbetter - 712-721 The Asymptotic Value in Finite Stochastic Games
by Miquel Oliu-Barton - 722-736 Truthful Generalized Assignments via Stable Matching
by Ning Chen & Nick Gravin & Pinyan Lu - 737-745 Topological Closure of Translation Invariant Preorders
by Efe A. Ok & Gil Riella - 746-774 Fluid Limits for Bandwidth-Sharing Networks with Rate Constraints
by Maria Remerova & Josh Reed & Bert Zwart - 775-788 Moments Tensors, Hilbert's Identity, and k -wise Uncorrelated Random Variables
by Bo Jiang & Simai He & Zhening Li & Shuzhong Zhang - 789-822 Closed-Form Expansions of Discretely Monitored Asian Options in Diffusion Models
by Ning Cai & Chenxu Li & Chao Shi - 823-840 On the Structure of Reduced Kernel Lattice Bases
by Karen Aardal & Frederik von Heymann - 841-850 Canonical Barriers on Convex Cones
by Roland Hildebrand - 851-862 A New Approach to the Pareto Stable Matching Problem
by Naoyuki Kamiyama - 863-888 Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution
by Arnoud V. den Boer - 889-907 Probability Bounds for Polynomial Functions in Random Variables
by Simai He & Bo Jiang & Zhening Li & Shuzhong Zhang - 908-929 Risk-Sensitive Control for the Multiclass Many-Server Queues in the Moderate Deviation Regime
by Anup Biswas - 930-948 The Nonnegative Node Weight j -Restricted k -Matching Problems
by Yanjun Li
May 2014, Volume 39, Issue 2
- 229-261 Correlation Decay in Random Decision Networks
by David Gamarnik & David A. Goldberg & Theophane Weber - 262-289 A Numerical Scheme for Invariant Distributions of Constrained Diffusions
by Amarjit Budhiraja & Jiang Chen & Sylvain Rubenthaler - 290-300 Derivation of a Cardinal Utility Through a Weak Trade-off Consistency Requirement
by Shiri Alon - 301-324 Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
by Boris S. Mordukhovich & T. T. A. Nghia - 325-373 Excursion-Based Universal Approximations for the Erlang-A Queue in Steady-State
by Itai Gurvich & Junfei Huang & Avishai Mandelbaum - 374-402 A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem
by Daniel Adelman & Christiane Barz - 403-417 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture
by Frans Schalekamp & David P. Williamson & Anke van Zuylen - 418-431 Large Deviations for the Stationary Measure of Networks Under Proportional Fair Allocations
by Matthieu Jonckheere & Sergio López - 432-444 An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem
by Danny Segev - 445-463 Lattices and Lotteries
by Elena Antoniadou & Leonard J Mirman & Richard Ruble - 464-486 Singular Control and Optimal Stopping of SPDEs, and Backward SPDEs with Reflection
by Bernt Øksendal & Agnès Sulem & Tusheng Zhang - 487-516 Closed-Form Expansion, Conditional Expectation, and Option Valuation
by Chenxu Li - 517-532 On Optimal Policies for Production-Inventory Systems with Compound Poisson Demand and Setup Costs
by Nicky D. Van Foreest & Jacob Wijngaard - 533-560 Fluid Limits for Bandwidth-Sharing Networks in Overload
by Sem Borst & Regina Egorova & Bert Zwart - 561-572 Approximability of Robust Network Design
by Neil Olver & F. Bruce Shepherd - 573-596 Concave Generalized Flows with Applications to Market Equilibria
by László A. Végh
February 2014, Volume 39, Issue 1
- 1-30 Stabilization of Stochastic Iterative Methods for Singular and Nearly Singular Linear Systems
by Mengdi Wang & Dimitri P. Bertsekas - 31-45 Regret in Online Combinatorial Optimization
by Jean-Yves Audibert & Sébastien Bubeck & Gábor Lugosi - 46-59 The Geometry of Online Packing Linear Programs
by Marco Molinaro & R. Ravi