Research Articles

Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis

Pages:2547–2584

Published Online:December 29, 2021

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

A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint

Pages:2585–2613

Published Online:February 10, 2022

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

Local Density Estimation in High Dimensions

Pages:2614–2640

Published Online:January 19, 2022

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

Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems

Pages:2641–2666

Published Online:February 1, 2022

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

An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint

Pages:2667–2690

Published Online:February 2, 2022

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

Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies

Pages:2691–2720

Published Online:February 7, 2022

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

A Unified Framework for Bayesian and Non-Bayesian Decision Making and Inference

Pages:2721–2742

Published Online:February 1, 2022

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

Equilibria in Multiclass and Multidimensional Atomic Congestion Games

Pages:2743–2764

Published Online:February 28, 2022

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

The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property

Pages:2765–2783

Published Online:February 10, 2022

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

Suboptimal Local Minima Exist for Wide Neural Networks with Smooth Activations

Pages:2784–2814

Published Online:March 25, 2022

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

Satisficing in Time-Sensitive Bandit Learning

Pages:2815–2839

Published Online:March 14, 2022

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

Finite State Mean Field Games with Wright–Fisher Common Noise as Limits of N-Player Weighted Games

Pages:2840–2890

Published Online:March 16, 2022

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

McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations

Pages:2891–2930

Published Online:February 14, 2022

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

A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition

Pages:2931–2949

Published Online:February 10, 2022

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

Distributionally Robust Chance Constrained Geometric Optimization

Pages:2950–2988

Published Online:January 28, 2022

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

On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization

Pages:2989–3009

Published Online:May 11, 2022

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

Stackelberg Max Closure with Multiple Followers

Pages:3010–3024

Published Online:April 1, 2022

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

Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem

Pages:3025–3050

Published Online:March 1, 2022

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

Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization

Pages:3051–3083

Published Online:March 1, 2022

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

Forbidden Transactions and Black Markets

Pages:3084–3109

Published Online:January 28, 2022

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

Gale’s Fixed Tax for Exchanging Houses

Pages:3110–3128

Published Online:March 15, 2022

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

Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling

Pages:3129–3155

Published Online:March 2, 2022

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

A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem

Pages:3156–3183

Published Online:January 24, 2022

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

Examples of Pathological Dynamics of the Subgradient Method for Lipschitz Path-Differentiable Functions

Pages:3184–3206

Published Online:May 5, 2022

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

Pipeline Interventions

Pages:3207–3238

Published Online:May 16, 2022

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

Entropy Regularization for Mean Field Games with Learning

Pages:3239–3260

Published Online:February 25, 2022

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

Bounding Residence Times for Atomic Dynamic Routings

Pages:3261–3281

Published Online:February 17, 2022

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

Slater Condition for Tangent Derivatives

Pages:3282–3303

Published Online:February 18, 2022

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

Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems

Pages:3304–3316

Published Online:February 16, 2022

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

Adaptive Bin Packing with Overflow

Pages:3317–3356

Published Online:February 25, 2022

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

Open Access
Consensus Halving for Sets of Items

Pages:3357–3379

Published Online:February 10, 2022

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

Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time

Pages:3380–3399

Published Online:March 22, 2022

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

Editorial Board

Free Access
Editorial Board

Pages:C2–C2

Published Online:November 18, 2022

https://doi.org/10.1287/moor.2022.eb.v47n4

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.