Operations Research Letters information

Operations Research Letters is a bimonthly peer-reviewed academic journal covering operations research. It was established in 1981 and is published by...

Operations research (British English: operational research) (U.S. Air Force Specialty Code: Operations Analysis), often shortened to the initialism OR...

MTZ polytope for the Asymmetric Traveling Salesman Problem". Operations Research Letters. 45 (4): 323–324. arXiv:1805.06997. doi:10.1016/j.orl.2017.04...

(July 1987). "Semi-greedy heuristics: An empirical study". Operations Research Letters. 6 (3): 107–114. doi:10.1016/0167-6377(87)90021-6. Feo, Thomas...

analysis of the next fit decreasing bin packing heuristic". Operations Research Letters. 5 (5): 233–236. doi:10.1016/0167-6377(86)90013-1. hdl:1765/11645...

Journal of Algorithms, SIAM Journal on Discrete Mathematics and Operations Research Letters. His work has been funded by the National Science Foundation...

"Reminiscences about the origins of linear programming" (PDF). Operations Research Letters. 1 (2): 43–48. doi:10.1016/0167-6377(82)90043-8. Archived from...

analysis of a greedy algorithm for the 0/1 knapsack problem". Operations Research Letters. 31 (3): 202–210. doi:10.1016/S0167-6377(02)00222-5. Lucas, Andrew...

"Reminiscences about the origins of linear programming" (PDF). Operations Research Letters. 1 (2): 43–48. doi:10.1016/0167-6377(82)90043-8. Archived from...

David S. (August 1963), "The Growth of Operations Research in Italy", Letters to the Editor, Operations Research, 11 (4): 653–658, doi:10.1287/opre.11...

median-finding algorithm for projecting a vector on the simplex of n". Operations Research Letters. 8 (4): 219. doi:10.1016/0167-6377(89)90064-3. A derivation of...

(1990), "An exact algorithm for the maximum clique problem", Operations Research Letters, 9 (6): 375–382, doi:10.1016/0167-6377(90)90057-C. Cazals, F...

maximal independent sets with applications to graph colouring", Operations Research Letters, 32 (6): 547–556, doi:10.1016/j.orl.2004.03.002 Chaitin, G. J...

response times in the M/GI/1/FB and M/GI/1/PS queues" (PDF). Operations Research Letters. 32: 73–76. doi:10.1016/S0167-6377(03)00061-0. Gautam, Natarajan...

complexity of scheduling tasks with discrete starting times". Operations Research Letters. 12 (5): 293–295. doi:10.1016/0167-6377(92)90087-j. Papadimitriou...

academic journals: A direct influence aggregation model" (PDF). Operations Research Letters. 43 (2): 172–176. doi:10.1016/j.orl.2015.01.007. S2CID 13310055...

m} operations O i j {\displaystyle O_{ij}} for i = 1 , … , m {\displaystyle i=1,\ldots ,m} . The operations can be scheduled in any order. Operation O...

(1990). "On the order of eliminating dominated strategies" (PDF). Operations Research Letters. 9 (2): 85–89. doi:10.1016/0167-6377(90)90046-8. Fudenberg, Drew;...

scheme for maximizing the minimum machine completion time". Operations Research Letters. 20 (4): 149–154. doi:10.1016/S0167-6377(96)00055-7. ISSN 0167-6377...

Parsiad; Carpenter, Tommy (2016). "Fast Engset computation". Operations Research Letters. 44 (3): 313–318. arXiv:1511.00291. doi:10.1016/j.orl.2016.02...

"Continuous line drawings via the traveling salesman problem" (PDF), Operations Research Letters, 32 (4): 302–303, doi:10.1016/j.orl.2003.10.001. Gutin, Gregory;...

"Simple linear time approximation algorithm for betweenness", Operations Research Letters, 40 (6): 450–452, doi:10.1016/j.orl.2012.08.008, MR 2998680....

Park, Sungsoo (1991), "A polyhedral approach to edge coloring", Operations Research Letters, 10 (6): 315–322, doi:10.1016/0167-6377(91)90003-8, MR 1128970...