| 981 | -- | 1001 | Hishammuddin Asmuni, Edmund K. Burke, Jonathan M. Garibaldi, Barry McCollum, Andrew J. Parkes. An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables |
| 1002 | -- | 1011 | Michael R. Wagner, Joy Bhadury, Steve Peng. Risk management in uncapacitated facility location models with random demands |
| 1012 | -- | 1025 | Fuh-Hwa Franklin Liu, Hao Hsuan Peng. A systematic procedure to obtain a preferable and robust ranking of units |
| 1026 | -- | 1049 | Jens Egeblad, David Pisinger. Heuristic approaches for the two- and three-dimensional knapsack packing problem |
| 1050 | -- | 1063 | Yi-Kuei Lin. Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths |
| 1064 | -- | 1089 | Natashia Boland, Irina Dumitrescu, Gary Froyland, Ambros M. Gleixner. LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity |
| 1090 | -- | 1109 | Dries R. Goossens, Frits C. R. Spieksma. Exact algorithms for the matrix bid auction |
| 1110 | -- | 1121 | Shih-Wei Lin, Kuo-Ching Ying, Zne-Jung Lee. Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times |
| 1122 | -- | 1144 | Patrik Flisberg, Bertil Lidén, Mikael Rönnqvist. A hybrid method based on linear programming and tabu search for routing of logging trucks |
| 1145 | -- | 1157 | Anders Dohn, Esben Kolind, Jens Clausen. The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach |
| 1158 | -- | 1175 | Feng-Cheng Lin, Jen-Shin Hong, Bertrand M. T. Lin. A two-machine flowshop problem with processing time-dependent buffer constraints - An application in multimedia presentations |
| 1176 | -- | 1190 | Konstantinos Paparrizos, Nikolaos Samaras, Angelo Sifaleras. An exterior simplex type algorithm for the Minimum Cost Network Flow Problem |
| 1191 | -- | 1203 | Giovanni Righini, Matteo Salani. Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming |
| 1204 | -- | 1220 | José H. Dulá, Francisco J. López. Preprocessing DEA |
| 1221 | -- | 1230 | Hai Wang, Shouhong Wang. Towards optimal use of incomplete classification data |
| 1231 | -- | 1248 | Ann Melissa Campbell, Barrett W. Thomas. Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines |
| 1249 | -- | 1267 | G. I. Zobolas, Christos D. Tarantilis, George Ioannou. Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm |
| 1268 | -- | 1283 | Rubén Ruiz, Ali Allahverdi. Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness |
| 1284 | -- | 1298 | Shervin AhmadBeygi, Amy Cohn, Marshall Weir. An integer programming approach to generating airline crew pairings |
| 1299 | -- | 1331 | Andrea Raith, Matthias Ehrgott. A comparison of solution strategies for biobjective shortest path problems |