default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 51
Volume 51, Number 1, 2026
- Editorial Board. iii
- Katya Scheinberg:
Editor's Comments on the 50th Anniversary of Mathematics of Operations Research. iv-viii - Hanyang Li
, Ying Cui:
Variational Theory and Algorithms for a Class of Asymptotically Approachable Nonconvex Problems. 1-34 - Renbo Zhao:
New Analysis of an Away-Step Frank-Wolfe Method for Minimizing Log-Homogeneous Barriers. 35-59 - Brian Hu Zhang, Gabriele Farina, Andrea Celli, Tuomas Sandholm:
Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation. 60-91 - Qiankun Shi, Xiao Wang, Hao Wang:
A Momentum-Based Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Optimization. 92-133 - Endre Boros, Joonhee Lee:
Boole's Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions. 134-148 - Weining Kang:
Well-Posedness and Sensitivity Analysis of a Fluid Model for Multiclass Many-Server Queues with Abandonment Under Global FCFS Discipline. 149-184 - Ugur Aydin, Naci Saldi:
Robustness and Approximation of Discrete-Time Mean-Field Games Under Discounted Cost Criterion. 185-217 - Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello:
The I.I.D. Prophet Inequality with Limited Flexibility. 218-254 - Adam Kurpisz, Aaron Potechin, Elias Samuel Wirth:
SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization. 255-276 - Shengyu Cao, Simai He, Zizhuo Wang, Yifan Feng:
Optimal Partition for a Multi-Type Queueing System. 277-298 - Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Streaming Submodular Maximization Under Matroid Constraints. 299-332 - Xuefeng Gao, Xunyu Zhou:
Square-Root Regret Bounds for Continuous-Time Episodic Markov Decision Processes. 333-357 - Naci Saldi:
Linear Mean-Field Games with Discounted Cost. 358-397 - Prakirt Raj Jhunjhunwala, Martin Zubeldia, Siva Theja Maguluri:
Join-the-Shortest Queue with Abandonment: Critically Loaded and Heavily Overloaded Regimes. 398-439 - Li Xia, Shuai Ma:
Global Algorithms for Mean-Variance Optimization in Markov Decision Processes. 440-455 - Christoph Hertrich, Yixin Tao, László A. Végh:
Mode Connectivity in Auction Design. 456-475 - Enrico Angelelli, Renata Mansini, Romeo Rizzi:
A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree. 476-497 - Hyun-Soo Ahn, Christopher Thomas Ryan, Joline Uichanco, Mengzhenyu Zhang:
Certainty-Equivalent Pricing with Dependent Demand and Limited Price-Changing Opportunities. 498-541 - Jie Xing, Jingtang Ma, Harry Zheng:
A Simple Integral Equation Approach for Optimal Investment Stopping Problems with Partial Information. 542-567 - Shipra Agrawal, Vashist Avadhanula, Vineet Goyal, Assaf Zeevi:
Thompson Sampling for the Multinomial Logit Bandit. 568-590 - Nguyen Thi Van Hang, M. Ebrahim Sarabi:
Convergence of Augmented Lagrangian Methods for Composite Optimization Problems. 591-620 - Xianghui Zhong:
Probabilistic Analysis of Edge Elimination for Euclidean TSP. 621-640 - Johannes Brustle, José Correa, Paul Dütting, Tomer Ezra, Michal Feldman, Victor Verdugo:
The Competition Complexity of Prophet Inequalities. 641-665 - Takashi Kunimoto, Rene Saran, Roberto Serrano:
Corrigendum to "Interim Rationalizable Implementation of Functions" (Kunimoto T, Saran R, Serrano R (2024) Mathematics of Operations Research 49(3):1791-1824). 666-667 - Jin Guang, Xinyun Chen, Jiangang Dai:
Uniform Moment Bounds for Generalized Jackson Networks in Multiscale Heavy Traffic. 668-685 - Lei Yang, Kim-Chuan Toh:
Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria. 686-714 - Danqing Zhou, Shiqian Ma, Junfeng Yang:
AdaBB: Adaptive Barzilai-Borwein Method for Convex Optimization. 715-745 - Quoc Tran-Dinh, Yang Luo:
Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems. 746-782 - Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga:
How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices? 783-805 - Ritesh Goenka, Eashan Gupta, Sushil Khyalia, Shivaram Kalyanakrishnan:
Upper Bounds for All and Max-Gain Policy Iteration Algorithms on Deterministic MDPs. 806-828 - Satoru Fujishige, Zaifu Yang:
A Universally Efficient Dynamic Auction for All Unimodular Demand Types. 829-851
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 2026-05-12 22:55 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:
