Research Articles

Variational Theory and Algorithms for a Class of Asymptotically Approachable Nonconvex Problems

Pages:1–34

Published Online:January 16, 2025

https://doi.org/10.1287/moor.2023.0202

New Analysis of an Away-Step Frank–Wolfe Method for Minimizing Log-Homogeneous Barriers

Pages:35–59

Published Online:January 20, 2025

https://doi.org/10.1287/moor.2023.0281

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation

Pages:60–91

Published Online:January 22, 2025

https://doi.org/10.1287/moor.2022.0226

A Momentum-Based Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Optimization

Pages:92–133

Published Online:January 23, 2025

https://doi.org/10.1287/moor.2022.0193

Boole’s Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions

Pages:134–148

Published Online:January 29, 2025

https://doi.org/10.1287/moor.2023.0019

Well-Posedness and Sensitivity Analysis of a Fluid Model for Multiclass Many-Server Queues with Abandonment Under Global FCFS Discipline

Pages:149–184

Published Online:January 29, 2025

https://doi.org/10.1287/moor.2023.0386

Robustness and Approximation of Discrete-Time Mean-Field Games Under Discounted Cost Criterion

Pages:185–217

Published Online:January 30, 2025

https://doi.org/10.1287/moor.2023.0316

The I.I.D. Prophet Inequality with Limited Flexibility

Pages:218–254

Published Online:January 31, 2025

https://doi.org/10.1287/moor.2022.0345

SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization

Pages:255–276

Published Online:February 6, 2025

https://doi.org/10.1287/moor.2024.0422

Optimal Partition for a Multi-Type Queueing System

Pages:277–298

Published Online:February 6, 2025

https://doi.org/10.1287/moor.2023.0035

Streaming Submodular Maximization Under Matroid Constraints

Pages:299–332

Published Online:February 10, 2025

https://doi.org/10.1287/moor.2023.0276

Square-Root Regret Bounds for Continuous-Time Episodic Markov Decision Processes

Pages:333–357

Published Online:February 12, 2025

https://doi.org/10.1287/moor.2022.0283

Linear Mean-Field Games with Discounted Cost

Pages:358–397

Published Online:February 17, 2025

https://doi.org/10.1287/moor.2023.0148

Join-the-Shortest Queue with Abandonment: Critically Loaded and Heavily Overloaded Regimes

Pages:398–439

Published Online:February 19, 2025

https://doi.org/10.1287/moor.2023.0098

Global Algorithms for Mean-Variance Optimization in Markov Decision Processes

Pages:440–455

Published Online:February 25, 2025

https://doi.org/10.1287/moor.2023.0176

Open Access
Mode Connectivity in Auction Design

Pages:456–475

Published Online:February 26, 2025

https://doi.org/10.1287/moor.2024.0525

A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree

Pages:476–497

Published Online:February 27, 2025

https://doi.org/10.1287/moor.2022.0306

Certainty-Equivalent Pricing with Dependent Demand and Limited Price-Changing Opportunities

Pages:498–541

Published Online:February 28, 2025

https://doi.org/10.1287/moor.2022.0330

A Simple Integral Equation Approach for Optimal Investment Stopping Problems with Partial Information

Pages:542–567

Published Online:February 28, 2025

https://doi.org/10.1287/moor.2023.0268

Thompson Sampling for the Multinomial Logit Bandit

Pages:568–590

Published Online:March 6, 2025

https://doi.org/10.1287/moor.2020.0096

Convergence of Augmented Lagrangian Methods for Composite Optimization Problems

Pages:591–620

Published Online:March 14, 2025

https://doi.org/10.1287/moor.2023.0324

Probabilistic Analysis of Edge Elimination for Euclidean TSP

Pages:621–640

Published Online:March 20, 2025

https://doi.org/10.1287/moor.2020.0299

The Competition Complexity of Prophet Inequalities

Pages:641–665

Published Online:March 25, 2025

https://doi.org/10.1287/moor.2024.0684

Corrigendum to “Interim Rationalizable Implementation of Functions” (Kunimoto T, Saran R, Serrano R (2024) Mathematics of Operations Research 49(3):1791–1824)

Pages:666–667

Published Online:March 25, 2025

https://doi.org/10.1287/moor.2024.0704

Uniform Moment Bounds for Generalized Jackson Networks in Multiscale Heavy Traffic

Pages:668–685

Published Online:March 26, 2025

https://doi.org/10.1287/moor.2024.0408

Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria

Pages:686–714

Published Online:March 28, 2025

https://doi.org/10.1287/moor.2023.0328

AdaBB: Adaptive Barzilai-Borwein Method for Convex Optimization

Pages:715–745

Published Online:March 31, 2025

https://doi.org/10.1287/moor.2024.0510

Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems

Pages:746–782

Published Online:April 2, 2025

https://doi.org/10.1287/moor.2024.0414

Open Access
How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices?

Pages:783–805

Published Online:April 4, 2025

https://doi.org/10.1287/moor.2023.0060

Upper Bounds for All and Max-Gain Policy Iteration Algorithms on Deterministic MDPs

Pages:806–828

Published Online:April 10, 2025

https://doi.org/10.1287/moor.2023.0317

A Universally Efficient Dynamic Auction for All Unimodular Demand Types

Pages:829–851

Published Online:April 17, 2025

https://doi.org/10.1287/moor.2023.0127

Editorial Board

Free Access
Editorial Board

Pages:iii–iii

Published Online:February 20, 2026

https://doi.org/10.1287/moor.2026.eb.v51n1

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.