References in zbMATH (referenced in 122 articles , 1 standard article )

Showing results 1 to 20 of 122.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. López-Sánchez, A. D.; Sánchez-Oro, J.; Hernández-Díaz, A. G.: GRASP and VNS for solving the (p)-next center problem (2019)
  2. Napoletano, Antonio; Martínez-Gavara, Anna; Festa, Paola; Pastore, Tommaso; Martí, Rafael: Heuristics for the constrained incremental graph drawing problem (2019)
  3. Martins, Daniel; Vianna, Gabriel M.; Rosseti, Isabel; Martins, Simone L.; Plastino, Alexandre: Making a state-of-the-art heuristic faster with data mining (2018)
  4. Consoli, Sergio; Moreno Pérez, José Andrés; Mladenović, Nenad: Comparison of metaheuristics for the (k)-labeled spanning forest problem (2017)
  5. Flores-Garza, David A.; Salazar-Aguilar, M. Angélica; Ngueveu, Sandra Ulrich; Laporte, Gilbert: The multi-vehicle cumulative covering tour problem (2017)
  6. Janssens, Jochen; Talarico, Luca; Sörensen, Kenneth: A metaheuristic for security budget allocation in utility networks (2017)
  7. Mancini, Simona: A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times (2017)
  8. Máximo, Vinícius R.; Nascimento, Mariá C. V.; Carvalho, André C. P. L. F.: Intelligent-guided adaptive search for the maximum covering location problem (2017)
  9. Bertolazzi, P.; Felici, G.; Festa, P.; Fiscon, G.; Weitschek, E.: Integer programming models for feature selection: new extensions and a randomized solution algorithm (2016)
  10. De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)
  11. Ferone, Daniele; Festa, Paola; Guerriero, Francesca; Laganà, Demetrio: The constrained shortest path tour problem (2016)
  12. Ferone, Daniele; Festa, Paola; Resende, Mauricio G. C.: Hybridizations of GRASP with path relinking for the far from most string problem (2016)
  13. Musmanno, Leonardo M.; Ribeiro, Celso C.: Heuristics for the generalized median graph problem (2016)
  14. Pillay, Nelishia: A review of hyper-heuristics for educational timetabling (2016)
  15. Gevezes, Theodoros; Pitsoulis, Leonidas: A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (2015)
  16. Martínez-Gavara, Anna; Campos, Vicente; Gallego, Micael; Laguna, Manuel; Martí, Rafael: Tabu search and GRASP for the capacitated clustering problem (2015)
  17. Bahiense, Laura; Frota, Yuri; Noronha, Thiago F.; Ribeiro, Celso C.: A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (2014)
  18. Bahmani, Sohail: Algorithms for sparsity-constrained optimization (2014)
  19. Bard, Jonathan F.; Shao, Yufen; Jarrah, Ahmad I.: A sequential GRASP for the therapist routing and scheduling problem (2014)
  20. Duarte, A.; Martí, R.; Resende, M. G. C.; Silva, R. M. A.: Improved heuristics for the regenerator location problem (2014)

1 2 3 ... 5 6 7 next