default search action
Mathematics of Operations Research, Volume 42
Volume 42, Number 1, February 2017
- Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
When Is a Network Epidemic Hard to Eliminate? 1-14 - Yakov Babichenko, Siddharth Barman, Ron Peretz:
Empirical Distribution of Equilibrium Play and Its Testing Application. 15-29 - Lijun Bo
, Agostino Capponi:
Robust Optimization of Credit Portfolios. 30-56 - Yun-Bin Zhao, Zhi-Quan Luo:
Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets. 57-76 - Mirjam Dür, Bolor Jargalsaikhan, Georg Still:
Genericity Results in Linear Conic Programming - A Tour d'Horizon. 77-94 - Jong-Shi Pang, Meisam Razaviyayn, Alberth Alvarado:
Computing B-Stationary Points of Nonsmooth DC Programs. 95-118 - Alexander Engau
Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization. 119-134 - Adam Kurpisz
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. 135-143 - Stephen R. Chestnut, Rico Zenklusen:
Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives. 144-166 - Stefania Minardi, Andrei Savochkin:
Characterizations of Smooth Ambiguity Based on Continuous and Discrete Data. 167-178 - László A. Végh
A Strongly Polynomial Algorithm for Generalized Flow Maximization. 179-211 - Kazutoshi Yamazaki
Inventory Control for Spectrally Positive Lévy Demand Processes. 212-237 - Yu Yokoi:
A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas. 238-255 - Retsef Levi, Robin Roundy, Van-Anh Truong, Xinshang Wang:
Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models. 256-276
Volume 42, Number 2, May 2017
- N. Bora Keskin, Assaf Zeevi:
Chasing Demand: Learning and Earning in a Changing Environment. 277-307 - Niv Buchbinder
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. 308-329 - Heinz H. Bauschke
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications. 330-348 - Jérôme Renault, Xavier Venel:
Long-Term Values in Markov Decision Processes and Repeated Games, and a New Distance for Probability Spaces. 349-376 - Iftah Gamzu, Danny Segev:
A Sublogarithmic Approximation for Tollbooth Pricing on Trees. 377-388 - Alberto Del Pia
A Polyhedral Study of Binary Polynomial Programs. 389-410 - Chien-Chung Huang, Telikepalli Kavitha:
New Algorithms for Maximum Weight Matching and a Decomposition Theorem. 411-426 - P. Jean-Jacques Herings
Best-Response Cycles in Perfect Information Games. 427-433 - Itai Feigenbaum, Jay Sethuraman, Chun Ye:
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs. 434-447 - Yan Dolinsky, H. Mete Soner
Convex Duality with Transaction Costs. 448-471 - Hamza Fawzi, James Saunderson
Equivariant Semidefinite Lifts of Regular Polygons. 472-494 - Maurice Queyranne, Fabio Tardella:
Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities. 495-516 - Sheung Chi Phillip Yam
Optimal Liquidation of Child Limit Orders. 517-545 - Lijun Bo
Optimal Credit Investment with Borrowing Costs. 546-575
Volume 42, Number 3, August 2017
- Michael J. O'Sullivan
Polynomial-Time Computation of Strong and n-Present-Value Optimal Policies in Markov Decision Chains. 577-598 - Ajay Subramanian, Baozhong Yang
Optimal Dynamic Risk Taking. 599-625 - Rami Atar, Subhamay Saha
An ɛ-Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic. 626-647 - Arunselvan Ramaswamy
A Generalization of the Borkar-Meyn Theorem for Stochastic Recursive Inclusions. 648-661 - Bingsheng He, Min Tao, Xiaoming Yuan:
Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming. 662-691 - Lei Ying
The Power of Slightly More than One Sample in Randomized Load Balancing. 692-722 - Tonghoon Suk, Jinwoo Shin:
Scheduling Using Interactive Optimization Oracles for Constrained Queueing Networks. 723-744 - Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Matroids Are Immune to Braess' Paradox. 745-761 - Zheng Wen, Benjamin Van Roy:
Efficient Reinforcement Learning in Deterministic Systems with Value Function Generalization. 762-782 - Damek Davis, Wotao Yin:
Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions. 783-805 - Denis Belomestny
Optimal Stopping Under Probability Distortions. 806-833 - Etienne de Klerk
Bound-Constrained Polynomial Optimization Using Only Elementary Calculations. 834-853 - Jean-Philippe Gayon, Guillaume Massonnet, Christophe Rapine
Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints. 854-875 - Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. 876-896
Volume 42, Number 4, November 2017
- Paul Dütting, Vasilis Gkatzelis, Tim Roughgarden:
The Performance of Deferred-Acceptance Auctions. 897-914 - Vassili Kolokoltsov
The Evolutionary Game of Pressure (or Interference), Resistance and Collaboration. 915-944 - Naci Saldi
On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces. 945-978 - Shuangchi He
Optimal Ordering Policy for Inventory Systems with Quantity-Dependent Setup Costs. 979-1006 - Nick Whiteley
Calculating Principal Eigen-Functions of Non-Negative Integral Kernels: Particle Approximations and Applications. 1007-1034 - Gennadiy Averkov, Jan Krümpelmann, Stefan Weltge
Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three. 1035-1062 - Wei Bian, Xiaojun Chen:
Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization. 1063-1084 - Xavier Bressaud, Anthony Quas
Dynamical Analysis of a Repeated Game with Incomplete Information. 1085-1105 - Alexander A. Razborov:
On the Width of Semialgebraic Proofs and Algorithms. 1106-1134 - Tiziano De Angelis, Salvatore Federico
Optimal Boundary Surface for Irreversible Investment with Stochastic Costs. 1135-1161 - János Flesch, Arkadi Predtetchinski
A Characterization of Subgame-Perfect Equilibrium Plays in Borel Games of Perfect Information. 1162-1179 - Nicole Bäuerle
Partially Observable Risk-Sensitive Markov Decision Processes. 1180-1196 - Maxim Sviridenko, Jan Vondrák, Justin Ward:
Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature. 1197-1218 - Benjamin Iriarte:
Graph Orientations and Linear Extensions. 1219-1229 - Emily Speakman, Jon Lee:
Quantifying Double McCormick. 1230-1253 - Massimiliano Amarante:
Information and Ambiguity: Toward a Foundation of Nonexpected Utility. 1254-1279 - Ulrich Horst, Michael Paulsen:
A Law of Large Numbers for Limit Order Books. 1280-1312
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-27 21:15 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: