Operations Research Letters

1.0(top 50%)

impact factor

3.7K(top 5%)

papers

71.1K(top 5%)

citations

105(top 5%)

h-index

1.0(top 50%)

impact factor

4.1K

all documents

75.8K

doc citations

168(top 5%)

g-index

Top Articles

#	Title	Journal	Year	Citations
1	Robust solutions of uncertain linear programs	Operations Research Letters	1999	1,383
2	Solving two-stage robust optimization problems using a column-and-constraint generation method	Operations Research Letters	2013	1,094
3	A probabilistic heuristic for a computationally difficult set covering problem	Operations Research Letters	1989	841
4	Mirror descent and nonlinear projected subgradient methods for convex optimization	Operations Research Letters	2003	594
5	The integer L-shaped method for stochastic integer programs with complete recourse	Operations Research Letters	1993	547
6	On Steiner trees and minimum spanning trees in hypergraphs	Operations Research Letters	2003	533
7	On the computational complexity of reliability redundancy allocation in a series system	Operations Research Letters	1992	503
8	Monte Carlo bounding techniques for determining solution quality in stochastic programs	Operations Research Letters	1999	501
9	On the convergence of the block nonlinear Gauss–Seidel method under convex constraints	Operations Research Letters	2000	474
10	A note on maximizing a submodular set function subject to a knapsack constraint	Operations Research Letters	2004	449
11	An exact algorithm for the maximum clique problem	Operations Research Letters	1990	425
12	Dual decomposition in stochastic integer programming	Operations Research Letters	1999	403
13	Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints	Operations Research Letters	1991	399
14	The carbon-constrained EOQ	Operations Research Letters	2013	368
15	Robust linear optimization under general norms	Operations Research Letters	2004	359
16	Translation invariance in data envelopment analysis	Operations Research Letters	1990	342
17	Branching rules revisited	Operations Research Letters	2005	327
18	Optimization of a 532-city symmetric traveling salesman problem by branch and cut	Operations Research Letters	1987	326
19	Financing newsvendor inventory	Operations Research Letters	2008	324
20	Finding odd cycle transversals	Operations Research Letters	2004	321
21	Units invariant and translation invariant DEA models	Operations Research Letters	1995	313
22	A new adaptive multi-start technique for combinatorial global optimizations	Operations Research Letters	1994	312
23	A decomposition algorithm for the single machine total tardiness problem	Operations Research Letters	1982	267
24	The berth planning problem	Operations Research Letters	1998	267
25	Efficient scheduling algorithms for a single batch processing machine	Operations Research Letters	1986	259
26	On generalized Nash games and variational inequalities	Operations Research Letters	2007	234
27	Computational complexity of uncapacitated multi-echelon production planning problems	Operations Research Letters	1989	230
28	Most vital links and nodes in weighted networks	Operations Research Letters	1982	217
29	Linear utility theory for belief functions	Operations Research Letters	1989	212
30	A simple efficient approximation scheme for the restricted shortest path problem	Operations Research Letters	2001	212
31	An O(pn2) algorithm for the p-median and related problems on tree graphs	Operations Research Letters	1996	203
32	A multi-stage methodology for the solution of orientated DEA models	Operations Research Letters	1998	201
33	Improving the Hungarian assignment algorithm	Operations Research Letters	1986	198
34	Consistent weights for judgements matrices of the relative importance of alternatives	Operations Research Letters	1987	194
35	Gomory cuts revisited	Operations Research Letters	1996	193
36	Analysis of a GI/M/1 queue with multiple working vacations	Operations Research Letters	2005	191
37	Numerical inversion of probability generating functions	Operations Research Letters	1992	188
38	Semi-greedy heuristics: An empirical study	Operations Research Letters	1987	177
39	Large-step markov chains for the TSP incorporating local search heuristics	Operations Research Letters	1992	176
40	An exact algorithm for IP column generation	Operations Research Letters	1996	170
41	Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint	Operations Research Letters	1997	166
42	MINTO, a mixed INTeger optimizer	Operations Research Letters	1994	165
43	Data-driven risk-averse stochastic optimization with Wasserstein metric	Operations Research Letters	2018	164
44	Minimizing makespan in hybrid flowshops	Operations Research Letters	1994	163
45	On the convergence of stochastic dual dynamic programming and related methods	Operations Research Letters	2008	163
46	The steepest descent direction for the nonlinear bilevel programming problem	Operations Research Letters	1994	158
47	A practical inventory control policy using operational statistics	Operations Research Letters	2005	158
48	Semi on-line algorithms for the partition problem	Operations Research Letters	1997	156
49	A polynomial-time approximation scheme for maximizing the minimum machine completion time	Operations Research Letters	1997	155
50	An O(n) algorithm for quadratic knapsack problems	Operations Research Letters	1984	154

Scientometrics

Overviews

Citing Bodies

Operations Research Letters

Family Medicine

Top Articles