Operations Research Letters

Aims & Scope

Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics.

Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published.

ORL covers the broad field of optimization, stochastic models and game theory.

Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering.

We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities.

Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies.

We also welcome novel applications and concise literature reviews.

Metrics & Ranking

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science, Decision Sciences, Engineering and Mathematics, designed to support cutting-edge academic discovery.

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Solving two-stage robust optimization problems using a column-and-constraint generation method

  Citation: 1468

  Authors: Bo, Long

• Robust solutions of uncertain linear programs

  Citation: 1343

  Authors: A., A.

• A probabilistic heuristic for a computationally difficult set covering problem

  Citation: 769

  Authors: Thomas A, Mauricio G.C

• The integer L-shaped method for stochastic integer programs with complete recourse

  Citation: 572

  Authors: Gilbert, François V.

• Mirror descent and nonlinear projected subgradient methods for convex optimization

  Citation: 539

  Authors: Amir, Marc

• On Steiner trees and minimum spanning trees in hypergraphs

  Citation: 521

  Authors: Tobias, Siavash Vahdati

• Monte Carlo bounding techniques for determining solution quality in stochastic programs

  Citation: 500

  Authors: Wai-Kei, David P., R.Kevin

• On the convergence of the block nonlinear Gauss–Seidel method under convex constraints

  Citation: 494

  Authors: L., M.

• A note on maximizing a submodular set function subject to a knapsack constraint

  Citation: 459

  Authors: Maxim

• On the computational complexity of reliability redundancy allocation in a series system

  Citation: 435

  Authors: Maw-Sheng