- S. Siraj, L. Mikhailov, J. A. Keane. Enumerating all spanning trees for pairwise comparisons. Computers & OR, 39(2):191-199, 2012.
- Pablo A. Maya, Kenneth Sörensen, Peter Goos. A metaheuristic for a teaching assistant assignment-routing problem. Computers & OR, 39(2):249-258, 2012.
- Sergiu Carpov, Jacques Carlier, Dritan Nace, Renaud Sirdey. Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage. Computers & OR, 39(3):736-745, 2012.
- Shunji Tanaka. A heuristic algorithm based on Lagrangian relaxation for the closest string problem. Computers & OR, 39(3):709-717, 2012.
- Mohamed Bendraouche, Mourad Boudhar. Scheduling jobs on identical machines with agreement graph. Computers & OR, 39(2):382-390, 2012.
- Lianxi Hong. An improved LNS algorithm for real-time vehicle routing problem with time windows. Computers & OR, 39(2):151-163, 2012.
- Ali R. Güner, Alper Murat, Ratna Babu Chinnam. Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information. Computers & OR, 39(2):358-373, 2012.
- Baruch Mor, Gur Mosheiov. Batch scheduling on uniform machines to minimize total flow-time. Computers & OR, 39(3):571-575, 2012.
- Sung Ho Ha, Ramayya Krishnan. Predicting repayment of the credit card debt. Computers & OR, 39(4):765-773, 2012.
- Amanda J. Schmitt, Lawrence V. Snyder. Infinite-horizon models for inventory control under yield uncertainty and disruptions. Computers & OR, 39(4):850-862, 2012.