1. On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem

   • Audrey Cerqueus
   • Xavier Gandibleux
   • Frédéric Saubion

   OriginalPaper 30 June 2017 Pages: 285 - 319

   

2. Metaheuristics approach for solving personalized crew rostering problem in public bus transit

   • Lin Xie
   • Marius Merschformann
   • Leena Suhl

   OriginalPaper 30 June 2017 Pages: 321 - 347

   

3. When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem

   • Jesus Garcia-Diaz
   • Jairo Sanchez-Hernandez
   • Rolando Menchaca-Mendez

   OriginalPaper 01 July 2017 Pages: 349 - 366

   

4. An efficient local search algorithm for the winner determination problem

   • Haochen Zhang
   • Shaowei Cai
   • Minghao Yin

   OriginalPaper 04 July 2017 Pages: 367 - 396

   

5. A heuristic approach for the stochastic optimization of mine production schedules

   • Luis Montiel
   • Roussos Dimitrakopoulos

   OriginalPaper Open access 04 July 2017 Pages: 397 - 415