Publisher
Springer Nature Switzerland
Reference9 articles.
1. Bianchessi, N., Corberán, Á., Plana, I., Reula, M., Sanchis, J.M.: The min-max close-enough arc routing problem. Eur. J. Oper. Res. 300(3), 837–851 (2022)
2. Bianchessi, N., Corberán, Á., Plana, I., Reula, M., Sanchis, J.M.: The profitable close-enough arc routing problem. Comput. Oper. Res. 140, 105653 (2022)
3. Corberán, Á., Plana, I., Reula, M., Sanchis, J.M.: A matheuristic for the distance-constrained close-enough arc routing problem. TOP 27, 312–326 (2019)
4. Corberán, Á., Plana, I., Reula, M., Sanchis, J.M.. PCEARP Instances. https://www.uv.es/plani/instancias.html. Accessed May 2023
5. Laguna, M., Martí, R.: GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11(1), 44–52 (1999)