Most cited papers in Optimization and Packing Problems
What are the most cited papers in Optimization and Packing Problems?
The most cited paper in Optimization and Packing Problems is "Integer and Combinatorial Optimization" (H. P. Williams, George L. Nemhauser, Laurence A. Wolsey, 1990), with 5,550 citations. Next come "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints" (4,300) and "Variable neighborhood search" (4,232).
Showing 50 of 99 papers. Every paper with more than 681 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Integer and Combinatorial Optimization H. P. Williams, George L. Nemhauser, Laurence A. Wolsey · Journal of the Operational Research Society | Feb 1990 | 5,550 |
| 2 | Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints Marius M. Solomon · Operations Research | Apr 1987 | 4,300 |
| 3 | Variable neighborhood search Nenad Mladenović, Pierre Hansen · Computers & Operations Research | Nov 1997 | 4,232 |
| 4 | Algorithm 97: Shortest path Robert W. Floyd · Communications of the ACM | Jun 1962 | 4,080 |
| 5 | Scheduling of Vehicles from a Central Depot to a Number of Delivery Points Graham Clarke, J. W. Wright · Operations Research | Aug 1964 | 3,908 |
| 6 | Partitioning procedures for solving mixed-variables programming problems J. F. Benders · Numerische Mathematik | Dec 1962 | 3,886 |
| 7 | Optimal two‐ and three‐stage production schedules with setup times included S. M. Johnson · Naval Research Logistics Quarterly | Mar 1954 | 3,269 |
| 8 | Knapsack Problems: Algorithms and Computer Implementations David Connolly, Silvano Martello, Paolo Toth · Journal of the Operational Research Society | Jun 1991 | 3,161 |
| 9 | Ant Algorithms for Discrete Optimization Marco Dorigo, Gianni A. Di, Luca Maria Gambardella · Artificial Life | Apr 1999 | 2,823 |
| 10 | Greedy Randomized Adaptive Search Procedures Thomas A. Feo, Maurício G. C. Resende · Journal of Global Optimization | Mar 1995 | 2,762 |
| 11 | – Ant System Thomas Stützle, Holger H. Hoos · Future Generation Computer Systems | Jun 2000 | 2,735 |
| 12 | Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems Jack Edmonds, Richard M. Karp · Journal of the ACM | Apr 1972 | 2,558 |
| 13 | Metaheuristics in Combinatorial Optimization Michel Gendreau, Jean‐Yves Potvin · Annals of Operations Research | Nov 2005 | 2,347 |
| 14 | Greedy Randomized Adaptive Search Procedures Maurício G. C. Resende, Celso Carneiro Ribeiro · Kluwer Academic Publishers eBooks | 2 Feb 2006 | 2,331 |
| 15 | Branch-and-Price: Column Generation for Solving Huge Integer Programs Cynthia Barnhart, Ellis L. Johnson, George L. Nemhauser et al. · Operations Research | Jun 1998 | 2,225 |
| 16 | The Lagrangian Relaxation Method for Solving Integer Programming Problems Marshall L. Fisher · Management Science | 1981 | 2,118 |
| 17 | Spatial Planning: A Configuration Space Approach Tomás Lozano‐Pérez · IEEE Transactions on Computers | Feb 1983 | 2,117 |
| 18 | Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems R. Venkata Rao · International Journal of Industrial Engineering Computations | 24 Aug 2015 | 2,078 |
| 19 | The Sample Average Approximation Method for Stochastic Discrete Optimization Anton J. Kleywegt, Alexander Shapiro, Tito Homem‐de‐Mello · SIAM Journal on Optimization | 2002 | 2,054 |
| 20 | A Linear Programming Approach to the Cutting-Stock Problem Paul C. Gilmore, Ralph E. Gomory · Operations Research | Dec 1961 | 2,030 |
| 21 | Various optimizers for single‐stage production Wayne E. Smith · Naval Research Logistics Quarterly | Mar 1956 | 1,839 |
| 22 | Optimization by simulated annealing: Quantitative studies Scott Kirkpatrick · Journal of Statistical Physics | Mar 1984 | 1,818 |
| 23 | The vehicle routing problem: An overview of exact and approximate algorithms Gilbert Laporte · European Journal of Operational Research | Jun 1992 | 1,763 |
| 24 | Nonlinear Programming--Sequential Unconstrained Minimization Techniques M. J. D. Powell · The Computer Journal | Aug 1969 | 1,753 |
| 25 | An improved typology of cutting and packing problems Gerhard Wäscher, Heike Haußner, Holger Schumann · European Journal of Operational Research | 20 Jun 2006 | 1,560 |
| 26 | A fast procedure for computing the distance between complex objects in three-dimensional space Éric Gilbert, Daniel Johnson, S. Sathiya Keerthi · IEEE Journal on Robotics and Automation | Apr 1988 | 1,517 |
| 27 | The Traveling-Salesman Problem and Minimum Spanning Trees Michael Held, Richard M. Karp · Operations Research | Dec 1970 | 1,456 |
| 28 | NP-complete scheduling problems Jeffrey David Ullman · Journal of Computer and System Sciences | Jun 1975 | 1,453 |
| 29 | A general heuristic for vehicle routing problems David Pisinger, Stefan Røpke · Computers & Operations Research | 25 Oct 2005 | 1,429 |
| 30 | Validation of subgradient optimization Michael Held, Philip Wolfe, Harlan P. Crowder · Mathematical Programming | Dec 1974 | 1,375 |
| 31 | HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS Fred Glover · Decision Sciences | 1977 | 1,363 |
| 32 | Complexity of vehicle routing and scheduling problems Jan Karel Lenstra, A. H. G. Rinnooy Kan · Networks | Jun 1981 | 1,324 |
| 33 | Routing and scheduling in a flexible job shop by tabu search Paolo Brandimarte · Annals of Operations Research | Sep 1993 | 1,317 |
| 34 | Container terminal operation and operations research - a classification and literature review Stefan Vo�, Robert Stahlbock, Dirk Steenken · OR Spectrum | 2004 | 1,270 |
| 35 | A Tabu Search Heuristic for the Vehicle Routing Problem Michel Gendreau, Alain Hertz, Gilbert Laporte · PolyPublie (École Polytechnique de Montréal) | Oct 1994 | 1,249 |
| 36 | A Heuristic Algorithm for the Vehicle-Dispatch Problem Billy E. Gillett, Leland R. Miller · Operations Research | Apr 1974 | 1,174 |
| 37 | Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem Nicos Christofides · Operations Research Forum | Mar 2022 | 1,152 |
| 38 | Job Shop Scheduling by Simulated Annealing Peter J. M. van Laarhoven, Emile Aarts, Jan Karel Lenstra · Operations Research | Feb 1992 | 1,130 |
| 39 | A Linear Programming Approach to the Cutting Stock Problem—Part II Paul C. Gilmore, Ralph E. Gomory · Operations Research | Dec 1963 | 1,117 |
| 40 | A typology of cutting and packing problems Harald Dyckhoff · European Journal of Operational Research | 1990 | 1,112 |
| 41 | Selected Topics in Column Generation Marco E. Lübbecke, Jacques Desrosiers · Operations Research | Dec 2005 | 1,109 |
| 42 | Lagrangean relaxation for integer programming Arthur M. Geoffrion · Mathematical programming studies | 1974 | 1,107 |
| 43 | Robust Discrete Optimization and Its Applications. A. E. Gerodimos, Panos Kouvelis, Gang Yu · Journal of the Operational Research Society | Dec 1998 | 1,082 |
| 44 | A new polynomial-time algorithm for linear programming Narendra K. Karmarkar | 1984 | 1,073 |
| 45 | Operations research at container terminals: a literature update Robert Stahlbock, Stefan Voß · OR Spectrum | 9 Oct 2007 | 1,073 |
| 46 | A generalized assignment heuristic for vehicle routing Marshall L. Fisher, Ramchandran Jaikumar · Networks | Jun 1981 | 1,071 |
| 47 | A probabilistic heuristic for a computationally difficult set covering problem Thomas A. Feo, Maurício G. C. Resende · Operations Research Letters | Apr 1989 | 1,060 |
| 48 | An Algorithm for the Traveling Salesman Problem John D. C. Little, Katta G. Murty, Dura W. Sweeney et al. · Operations Research | Dec 1963 | 1,059 |
| 49 | A simple and effective evolutionary algorithm for the vehicle routing problem Christian Prins · Computers & Operations Research | 2 Jun 2003 | 1,051 |
| 50 | The traveling-salesman problem and minimum spanning trees: Part II Michael Held, Richard M. Karp · Mathematical Programming | Dec 1971 | 1,022 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.