- David Kronus. Relations between threshold and ::::k::::-interval Boolean functions. Annals OR, 188(1):263-278, 2011.
- Luc Mercier, Pascal Van Hentenryck. An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization. Annals OR, 184(1):233-271, 2011.
- Hideki Hashimoto, Sylvain Boussier, Michel Vasquez, Christophe Wilbaut. A GRASP-based approach for technicians and interventions scheduling for telecommunications. Annals OR, 183(1):143-161, 2011.
- Van Bang Le. Two characterizations of chain partitioned probe graphs. Annals OR, 188(1):279-283, 2011.
- Marcello Colledani, Tullio Tolio. Performance evaluation of transfer lines with general repair times and multiple failure modes. Annals OR, 182(1):31-65, 2011.
- Nizar El Hachemi, Michel Gendreau, Louis-Martin Rousseau. A hybrid constraint programming approach to the log-truck scheduling problem. Annals OR, 184(1):163-178, 2011.
- Stefan Helber, Katja Schimmelpfeng, Raik Stolletz, Svenja Lagershausen. Using linear programming to analyze and optimize stochastic flow lines. Annals OR, 182(1):193-211, 2011.
- Illana Bendavid, Boaz Golany. Predetermined intervals for start times of activities in the stochastic project scheduling problem. Annals OR, 186(1):429-442, 2011.
- Nima Safaei, Dragan Banjevic, Andrew K. S. Jardine. Workforce-constrained maintenance scheduling for military aircraft fleet: a case study. Annals OR, 186(1):295-316, 2011.
- Alex S. Fukunaga. A branch-and-bound algorithm for hard multiple knapsack problems. Annals OR, 184(1):97-119, 2011.