| 1919 | -- | 1926 | Inna G. Drobouchevitch, Jeffrey B. Sidney. Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs |
| 1927 | -- | 1932 | Enrique Gerstl, Gur Mosheiov. Scheduling job classes on uniform machines |
| 1933 | -- | 1950 | Rhyd Lewis, Jonathan M. Thompson, C. Mumford, J. Gillard. A wide-ranging computational comparison of high-performance graph colouring algorithms |
| 1951 | -- | 1968 | Arnaud Zinflou, Caroline Gagné, Marc Gravel. GISMOO: A new hybrid genetic/immune strategy for multiple-objective optimization |
| 1969 | -- | 1976 | Claudio T. Bornstein, Nelson Maculan, Marta Pascoal, Leizer L. Pinto. Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization |
| 1977 | -- | 1987 | Lixin Tang, Ping Che, Jiyin Liu. A stochastic production planning problem with nonlinear cost |
| 1988 | -- | 2000 | Xiang Song, Rhyd Lewis, Jonathan M. Thompson, Yue Wu. An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem |
| 2001 | -- | 2015 | Seung Ho Yoo, DaeSoo Kim, Myung-Sub Park. Inventory models for imperfect production and inspection processes with various inspection options under one-time and continuous improvement investment |
| 2016 | -- | 2032 | K. Antony Arokia Durai Raj, Chandrasekharan Rajendran. A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem |
| 2033 | -- | 2050 | Jean-François Cordeau, Mirko Maischberger. A parallel iterated tabu search heuristic for vehicle routing problems |
| 2051 | -- | 2062 | Marcial Lapp, Amy Cohn. Modifying lines-of-flight in the planning process for improved maintenance robustness |
| 2063 | -- | 2078 | Pasquale Legato, Roberto Trunfio, Frank Meisel. Modeling and solving rich quay crane scheduling problems |
| 2079 | -- | 2090 | Kenneth Sörensen, Christine Vanovermeire, Sylvie Busschaert. Efficient metaheuristics to solve the intermodal terminal location problem |
| 2091 | -- | 2099 | Diogo Quintas, Vasilis Friderikos. Energy efficient spatial TDMA scheduling in wireless networks |
| 2100 | -- | 2110 | Lu Zhen. Analytical study on multi-product production planning with outsourcing |
| 2111 | -- | 2121 | Vincent C. Li, Yun-Chia Liang, Huan-Fu Chang. Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method |
| 2122 | -- | 2132 | Ali Khanafer 0001, François Clautiaux, Saïd Hanafi, El-Ghazali Talbi. The min-conflict packing problem |
| 2133 | -- | 2141 | Alexandre Xavier Martins, Christophe Duhamel, Philippe Mahey, Rodney Rezende Saldanha, Maurício C. de Souza. Variable neighborhood descent with iterated local search for routing and wavelength assignment |
| 2142 | -- | 2151 | Alejandro Rodríguez, Rubén Ruiz. A study on the effect of the asymmetry on real capacitated vehicle routing problems |
| 2152 | -- | 2160 | Guanlong Deng, Xingsheng Gu. A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion |
| 2161 | -- | 2167 | Jørgen Glomvik Rakke, Marielle Christiansen, Kjetil Fagerholt, Gilbert Laporte. The Traveling Salesman Problem with Draft Limits |
| 2168 | -- | 2177 | Wei-Chang Yeh. Simplified swarm optimization in disassembly sequencing problems with learning effects |
| 2178 | -- | 2195 | Wenbin Zhu, Hu Qin, Andrew Lim, Lei Wang. A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP |
| 2196 | -- | 2205 | Ju Yong Lee, Yeong-Dae Kim. Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance |
| 2206 | -- | 2213 | Emilio Carrizosa, Milan Drazic, Zorica Drazic, Nenad Mladenovic. Gaussian variable neighborhood search for continuous optimization |
| 2214 | -- | 2222 | Itziar Landa-Torres, Javier Del Ser, Sancho Salcedo-Sanz, Sergio Gil-Lopez, José Antonio Portilla-Figueras, Oscar Alonso-Garrido. A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem |
| 2223 | -- | 2231 | Jorge M. S. Valente, Jeffrey E. Schaller. Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem |
| 2232 | -- | 2241 | Patricio Hernández, Antonio Alonso-Ayuso, Fernanda Bravo, Laureano F. Escudero, Monique Guignard, Vladimir Marianov, Andres Weintraub. A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty |
| 2242 | -- | 2247 | Heng-Soon Gan, Andrew Wirth, Amir H. Abdekhodaee. A branch-and-price algorithm for the general case of scheduling parallel machines with a single server |
| 2248 | -- | 2257 | Andreas Bortfeldt. A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints |
| 2258 | -- | 2264 | Wojciech Bozejko. On single-walk parallelization of the job shop problem solving algorithms |
| 2265 | -- | 0 | Sajid Siraj, Ludmil Mikhailov, John A. Keane. Corrigendum to "Enumerating all spanning trees for pairwise comparisons" [Computers & OR 39 (2012) 191-199] |
| 2266 | -- | 0 | Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez. An algorithmic framework for solving large scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees |