| 2817 | -- | 2825 | Chen-Fu Chen, Muh-Cherng Wu, Keng-Han Lin. Effect of solution representations on Tabu search in scheduling applications |
| 2826 | -- | 2835 | Daqin Wang, Ou Tang, Jiazhen Huo. A heuristic for rationing inventory in two demand classes with backlog costs and a service constraint |
| 2836 | -- | 2843 | Jaehwan Yang. A two-stage hybrid flow shop with dedicated machines at the first stage |
| 2844 | -- | 2851 | José M. Gutiérrez, Marcos Colebrook, Beatriz Abdul-Jalbar, Joaquin Sicilia. Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities |
| 2852 | -- | 2863 | Derya Sever, Nico P. Dellaert, Tom Van Woensel, Ton de Kok. Dynamic shortest path problems: Hybrid routing policies considering network disruptions |
| 2864 | -- | 2877 | Yuan Yuan, Hua Xu. An integrated search heuristic for large-scale flexible job shop scheduling problems |
| 2878 | -- | 2892 | Maria Albareda-Sambola, Antonio Alonso-Ayuso, Laureano F. Escudero, Elena Fernández, Celeste Pizarro. Fix-and-Relax-Coordination for a multi-period location-allocation problem under uncertainty |
| 2893 | -- | 2905 | Alper Hamzadayi, Seyda Topaloglu, Simge Yelkenci Kose. Nested simulated annealing approach to periodic routing problem of a retail distribution system |
| 2906 | -- | 2929 | Xiao-yuan Wang, Zhili Zhou, Xi Zhang, Ping Ji, Ji-Bo Wang. Several flow shop scheduling problems with truncated position-based learning effect |
| 2930 | -- | 2939 | André R. S. Amaral. A parallel ordering problem in facilities layout |
| 2940 | -- | 2949 | Ariel C. Zeballos, Ralf W. Seifert, Margarita Protopappa-Sieke. Single product, finite horizon, periodic review inventory model with working capital requirements and short-term debt |
| 2950 | -- | 2960 | Unai Aldasoro, Laureano F. Escudero, María Merino, Gloria Pérez. An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. Part II: Parallelization |
| 2961 | -- | 2969 | Harish Garg, Monica Rani, S. P. Sharma. An efficient two phase approach for solving reliability-redundancy allocation problem using artificial bee colony technique |
| 2970 | -- | 2974 | Min Ji, Jen-Ya Wang, Wen-Chiung Lee. Minimizing resource consumption on uniform parallel machines with a bound on makespan |
| 2975 | -- | 2982 | Wen Jin, Shuiping Chen, Hai Jiang. Finding the K shortest paths in a time-schedule network with constraints on arcs |
| 2983 | -- | 2990 | Xiaolin Li, Yanli Huang, Qi Tan, Huaping Chen. Scheduling unrelated parallel batch processing machines with non-identical job sizes |
| 2991 | -- | 2999 | Hatice Calik, Barbaros C. Tansel. Double bound method for solving the p-center location problem |
| 3000 | -- | 3009 | Gabriel Gutiérrez-Jarpa, Carlos Obreque, Gilbert Laporte, Vladimir Marianov. Rapid transit network design for optimal cost and origin-destination demand capture |
| 3010 | -- | 3020 | Marc Goerigk, Bob Grün, Philipp Heßler. Branch and bound algorithms for the bus evacuation problem |
| 3021 | -- | 3032 | Eugenio K. Epprecht, Francisco Aparisi, Sandra García-Bustos. Optimal linear combination of Poisson variables for multivariate statistical process control |
| 3033 | -- | 3044 | Paraskevi Th. Zacharia, Andreas C. Nearchou. A meta-heuristic algorithm for the fuzzy assembly line balancing type-E problem |
| 3045 | -- | 3055 | Jinn-Tsong Tsai, Jia-Cen Fang, Jyh-Horng Chou. Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm |
| 3056 | -- | 3068 | M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel. Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems |
| 3069 | -- | 3079 | Samir Sebbah, Ahmed Ghanmi, Abdeslem Boukhtouta. A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution |
| 3080 | -- | 0 | Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro. Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications |
| 3081 | -- | 3090 | Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit. A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems |
| 3091 | -- | 3099 | Rafael Martí, Fernando Sandoya. GRASP and path relinking for the equitable dispersion problem |
| 3100 | -- | 3107 | Yang Wang, Zhipeng Lü, Fred Glover, Jin-Kao Hao. Probabilistic GRASP-Tabu Search algorithms for the UBQP problem |
| 3108 | -- | 3120 | Roberto Cordone, Guglielmo Lulli. A GRASP metaheuristic for microarray data analysis |
| 3121 | -- | 3131 | Mariá Cristina Vasconcelos Nascimento, Leonidas S. Pitsoulis. Community detection by modularity maximization using GRASP with path relinking |
| 3132 | -- | 3146 | Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro. A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering |
| 3147 | -- | 3158 | Dorabella Santos, Amaro de Sousa, Filipe Alvelos. A hybrid column generation with GRASP and path relinking for the network load balancing problem |
| 3159 | -- | 3173 | Hugo Barbalho, Isabel Rosseti, Simone L. Martins, Alexandre Plastino. A hybrid data mining GRASP with path-relinking |
| 3174 | -- | 3187 | Óscar Pedrola, Marc Ruiz, Luis Velasco, Davide Careglio, Oscar González de Dios, Jaume Comellas. A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem |
| 3188 | -- | 3196 | Renato E. N. Moraes, Celso C. Ribeiro. Power optimization in ad hoc wireless network topology control with biconnectivity requirements |
| 3197 | -- | 3205 | Kenneth Sörensen, Patrick Schittekat. Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem |
| 3206 | -- | 3217 | Fabio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França. GRASP with evolutionary path-relinking for the capacitated arc routing problem |
| 3218 | -- | 3229 | Mário Mestria, Luiz Satoru Ochi, Simone de Lima Martins. GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem |