Request Username
Can't sign in? Forgot your username?
Enter your email address below and we will send you your username
In This Issue
Contextual Areas
Effects of Reactive Capacity on Product Quality and Firm Profitability in an Uncertain Market
Pages:2619–2636
Published Online:June 8, 2022
A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility
Pages:2655–2673
Published Online:June 10, 2022
An Optimal Control Framework for Online Job Scheduling with General Cost Functions
Pages:2674–2701
Published Online:June 22, 2022
Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems
Pages:2715–2731
Published Online:June 23, 2022
Crosscutting Areas
Individualized Dynamic Patient Monitoring Under Alarm Fatigue
Pages:2749–2766
Published Online:September 26, 2022
Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets
Pages:2784–2803
Published Online:July 28, 2022
Allocation with Weak Priorities and General Constraints
Pages:2804–2819
Published Online:July 11, 2022
Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model
Pages:2820–2836
Published Online:August 17, 2022
Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management
Pages:2837–2850
Published Online:August 11, 2022
Methods
Technical Note—Ranking Distributions When Only Means and Variances Are Known
Pages:2851–2859
Published Online:March 9, 2021
Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming
Pages:2867–2882
Published Online:November 10, 2021
Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems
Pages:2906–2930
Published Online:December 17, 2021
Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Nonconvex Stochastic Optimization: Nonasymptotic Performance Bounds and Momentum-Based Acceleration
Pages:2931–2947
Published Online:October 22, 2021
Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
Pages:2948–2966
Published Online:November 30, 2021
An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model
Pages:2967–2981
Published Online:December 28, 2021
New Venture Creation: A Drift-Variance Diffusion Control Model
Pages:2982–2997
Published Online:November 2, 2021
Extremizing and Antiextremizing in Bayesian Ensembles of Binary-Event Forecasts
Pages:2998–3014
Published Online:January 12, 2022
Dynamic Programs with Shared Resources and Signals: Dynamic Fluid Policies and Asymptotic Optimality
Pages:3015–3033
Published Online:December 16, 2021
