| 2885 | -- | 2891 | Jack Brimberg, Nenad Mladenovic, Dragan Urosevic, Eric Ngai. Variable neighborhood search for the heaviest k-subgraph |
| 2892 | -- | 2898 | João C. N. Clímaco, Marta M. B. Pascoal. Finding non-dominated bicriteria shortest pairs of disjoint simple paths |
| 2899 | -- | 2904 | Jia Shu, I. A. Karimi. Efficient heuristics for inventory placement in acyclic networks |
| 2905 | -- | 2912 | Rafael Martí, José Luis González Velarde, Abraham Duarte. Heuristics for the bi-objective path dissimilarity problem |
| 2913 | -- | 2925 | Francisco Ballestín, Vicente Valls, Sacramento Quintanilla. Scheduling projects with limited number of preemptions |
| 2926 | -- | 2936 | Nabil Absi, Safia Kedad-Sidhoum. The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs |
| 2937 | -- | 2943 | Sigrid Knust, Daniel Lücking. Minimizing costs in round robin tournaments with place constraints |
| 2944 | -- | 2954 | Cláudio Alves, Rita Macedo, José M. Valério de Carvalho. New lower bounds based on column generation and constraint programming for the pattern minimization problem |
| 2955 | -- | 2968 | Rodrigo Moretti Branchini, Vinícius Amaral Armentano, Arne Løkketangen. Adaptive granular local search heuristic for a dynamic vehicle routing problem |
| 2969 | -- | 2982 | Pedro Martins, Maurício C. de Souza. VNS and second order heuristics for the min-degree constrained minimum spanning tree problem |
| 2983 | -- | 2993 | Ángel Felipe, M. Teresa Ortuño, Gregorio Tirado. The double traveling salesman problem with multiple stacks: A variable neighborhood search approach |
| 2994 | -- | 3001 | Amir Abbas Najafi, Seyed Taghi Akhavan Niaki, Moslem Shahsavar. A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations |
| 3002 | -- | 3012 | Mauro Dell Amico, José Carlos Díaz Díaz, Manuel Iori, Roberto Montanari. The single-finger keyboard layout problem |
| 3013 | -- | 3018 | Rob A. C. M. Broekmeulen, Karel H. van Donselaar. A heuristic to manage perishable inventory with batch ordering, positive lead-times, and time-varying demand |
| 3019 | -- | 3030 | Jinfeng Li, Feng Chu, Christian Prins. Lower and upper bounds for a capacitated plant location problem with multicommodity flow |
| 3031 | -- | 3040 | T. C. Edwin Cheng, Bertrand M. T. Lin, Y. Tian. Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times |
| 3041 | -- | 3050 | Maria Battarra, Michele Monaci, Daniele Vigo. An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem |
| 3051 | -- | 3060 | Lars Magnus Hvattum, Kjetil Fagerholt, Vinícius Amaral Armentano. Tank allocation problems in maritime bulk shipping |
| 3061 | -- | 3072 | Stephen Mahar, P. Daniel Wright. The value of postponing online fulfillment decisions in multi-channel retail/e-tail organizations |
| 3073 | -- | 3081 | Chun-Lung Chen, Chuen-Lung Chen. A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines |
| 3082 | -- | 3085 | M. Eugénia V. Captivo, João C. N. Clímaco, Marta M. B. Pascoal. A mixed integer linear formulation for the minimum label spanning tree problem |