ScienceDirect
INTRODUCTION
The ScienceDirect TOP25 Hottest Articles is a free quarterly service from ScienceDirect. When you subscribe to the ScienceDirect TOP25, you'll receive an e-mail every three months listing the ScienceDirect users' 25 most frequently downloaded journal articles, from any selected journal among more than 1,600 titles in the ScienceDirect database, or from any of 24 subject areas.

Now you can keep track of the latest trends in your speciality and find out what your colleagues are reading. A simple click on any of the listed articles will take you to the journal abstract, and of course, you have the option to download any article straight to your desktop, depending on your access rights.
Hottest Articles on Sciencedirect.com
Check out the ScienceDirect TOP25 Hottest Articles within your area of interest.
Subject Area:
Journal:
With these drop-down menus, the ScienceDirect TOP25 Hottest Articles are selected. Please refine your selection if necessary. To see the overall TOP25 within a certain subject area or journal, please select 'all subjects' or 'all journals' from the drop-down menus.
 
 

TOP25 articles within the journal:

Operations Research Letters

  1. Match twice and stitch: a new TSP tour construction heuristic Short communication
    Operations Research Letters, Volume 32, Issue 6, 1 November 2004, Pages 499-509
    A.B. Kahng, S. Reda
  2. Inventory replenishment model: lot sizing versus just-in-time delivery Short communication
    Operations Research Letters, Volume 32, Issue 6, 1 November 2004, Pages 581-590
    C.-Y. Lee
  3. Robust linear optimization under general norms Short communication
    Operations Research Letters, Volume 32, Issue 6, 1 November 2004, Pages 510-516
    D. Bertsimas, D. Pachamanova, M. Sim
  4. Project scheduling: a review of recent books Book review
    Operations Research Letters, Volume 33, Issue 1, 1 January 2005, Pages 105-110
    T. Kis
  5. A new linearization technique for multi-quadratic 0-1 programming problems Short communication
    Operations Research Letters, Volume 32, Issue 6, 1 November 2004, Pages 517-522
    W. Chaovalitwongse, P.M. Pardalos, O.A. Prokopyev
  6. An approximation algorithm for square packing Short communication
    Operations Research Letters, Volume 32, Issue 6, 1 November 2004, Pages 535-539
    R. van Stee
  7. Branching rules revisited Short communication
    Operations Research Letters, Volume 33, Issue 1, 1 January 2005, Pages 42-54
    T. Achterberg, T. Koch, A. Martin
  8. New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints Short communication
    Operations Research Letters, Volume 33, Issue 1, 1 January 2005, Pages 62-70
    S.C. Sarin, H.D. Sherali, A. Bhootra
  9. On the complexity of the k-customer vehicle routing problem Short communication
    Operations Research Letters, Volume 33, Issue 1, 1 January 2005, Pages 71-76
    R. Hassin, S. Rubinstein
  10. A simple recipe for concise mixed 0-1 linearizations Short communication
    Operations Research Letters, Volume 33, Issue 1, 1 January 2005, Pages 55-61
    W.P. Adams, R.J. Forrester
  11. Enumerating maximal independent sets with applications to graph colouring Short communication
    Operations Research Letters, Volume 32, Issue 6, 1 November 2004, Pages 547-556
    J.M. Byskov
  12. On the nearest neighbor rule for the traveling salesman problem Short communication
    Operations Research Letters, Volume 32, Issue 1, 1 January 2004, Pages 1-4
    C.A.J. Hurkens, G.J. Woeginger
  13. On-line scheduling to minimize average completion time revisited Short communication
    Operations Research Letters, Volume 32, Issue 5, 1 September 2004, Pages 485-490
    N. Megow, A.S. Schulz
  14. Transport risk models for hazardous materials: revisited Short communication
    Operations Research Letters, Volume 33, Issue 1, 1 January 2005, Pages 81-89
    E. Erkut, A. Ingolfsson
  15. Inapproximability results for no-wait job shop scheduling Short communication
    Operations Research Letters, Volume 32, Issue 4, 1 July 2004, Pages 320-325
    G.J. Woeginger
  16. Strongly polynomial-time approximation for a class of bicriteria problems Short communication
    Operations Research Letters, Volume 32, Issue 6, 1 November 2004, Pages 530-534
    A. Levin
  17. Tales of Hoffman Book review
    Operations Research Letters, Volume 32, Issue 6, 1 November 2004, Pages 591-594
    U. G. Rothblum
  18. On the controversy over tailweight of distributions Short communication
    Operations Research Letters, Volume 32, Issue 5, 1 September 2004, Pages 399-408
    C.C. Heyde, S.G. Kou
  19. The combinatorics of pivoting for the maximum weight clique Short communication
    Operations Research Letters, Volume 32, Issue 6, 1 November 2004, Pages 523-529
    M. Locatelli, I.M. Bomze, M. Pelillo
  20. An invariance property of sojourn times in cyclic networks Short communication
    Operations Research Letters, Volume 33, Issue 1, 1 January 2005, Pages 1-8
    C. Malchin, H. Daduna
  21. Dominating set games Short communication
    Operations Research Letters, Volume 32, Issue 6, 1 November 2004, Pages 565-573
    B. van Velzen
  22. Lift-and-project ranks and antiblocker duality Short communication
    Operations Research Letters, Volume 33, Issue 1, 1 January 2005, Pages 35-41
    L. Liptak, L. Tuncel
  23. A bilevel programming approach to the travelling salesman problem Short communication
    Operations Research Letters, Volume 32, Issue 3, 1 May 2004, Pages 240-248
    P. Marcotte, G. Savard, F. Semet
  24. On the complexity of the car sequencing problem Short communication
    Operations Research Letters, Volume 32, Issue 4, 1 July 2004, Pages 331-335
    T. Kis
  25. Equivalence of two linear programming relaxations for broadcast scheduling Short communication
    Operations Research Letters, Volume 32, Issue 5, 1 September 2004, Pages 473-478
    S. Khuller, Y.-A. Kim
Do you want to search in other fields of interest?
Just go to the top of the page and use the drop-down menus to select another TOP25.



Sign up!
Would you like to be kept posted on the latest TOP25 ARTICLES within Operations Research Letters?
Sign up! for the email service. Click here