Journal Report

Operations Research Letters

Download PDF
Journal Information
Journal Title
Operations Research Letters
Publisher
ISSN
0167-6377
E-ISSN
Database
CNRS
Domain
Physical Sciences, Social Sciences
Classification History
Year A+ A B C
2026 ✓ ✓
2025 ✓ ✓
2024 ✓ ✓
2023 ✓ ✓
2021/2022 ✓ ✓
2020 ✓ ✓
2019 ✓ ✓
2018 ✓
A journal may have more than one classification in the same year. All recorded classifications are displayed.
Recent Articles
Exact counting via duality: Applications to supply chain networks
Ashish Chandra
2027-3 Vol. 71 Pages 107570
DOI: 10.1016/j.orl.2026.107570
Second-order characterizations of the egalitarian non-separable contribution value
Jun Guo, Jian Lin
2027-3 Vol. 71 Pages 107552
DOI: 10.1016/j.orl.2026.107552
A note on Schatten-p quasi-norm for affine matrix rank minimization
Angang Cui
2027-3 Vol. 71 Pages 107547
DOI: 10.1016/j.orl.2026.107547
Distributionally robust optimization with integer recourse: Convex reformulations and critical recourse decisions
Yiling Zhang, Zhe Li, Eojin Han
2027-3 Vol. 71 Pages 107546
DOI: 10.1016/j.orl.2026.107546
A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
Aida Khajavirad
2027-3 Vol. 71 Pages 107563
DOI: 10.1016/j.orl.2026.107563
Two-timescale stochastic approximation for smooth and strongly-convex-strongly-concave stochastic minimax optimization: A new convergence rate
Xiangyu Yang
2027-3 Vol. 71 Pages 107550
DOI: 10.1016/j.orl.2026.107550
Exact CVaR evaluation in O(plog N) time for single-factor stochastic pickup-and-delivery routing
Hoang-Viet Vu, Quang-Vinh Dang, Son P. Nguyen
2027-3 Vol. 71 Pages 107562
DOI: 10.1016/j.orl.2026.107562
Improved rounding algorithms for set cover via exponential clocks
Kishen N. Gowda, Will Ma, Aravind Srinivasan et al.
2027-3 Vol. 71 Pages 107553
DOI: 10.1016/j.orl.2026.107553
Exact analysis of a split–merge queue with latent Erlang-factor dependent subtask times
Dawit Zerom
2027-3 Vol. 71 Pages 107564
DOI: 10.1016/j.orl.2026.107564
An improved lower bound for the online preemptive single-machine weighted completion time problem
Samin Jamalabadi, Uwe Schwiegelshohn
2027-3 Vol. 71 Pages 107548
DOI: 10.1016/j.orl.2026.107548
Articles retrieved from Crossref.
Green Journals | https://www.green-journals.com | info@green-journals.com
Printed: November 3, 2026 07:07