José María Sanchís Llopis-rekin lankidetzan egindako argitalpenak (33)

2024

  1. The multidepot drone general routing problem with duration and capacity constraints

    International Transactions in Operational Research

  2. Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem

    Computers and Operations Research, Vol. 162

2023

  1. The multi-purpose K-drones general routing problem

    Networks, Vol. 82, Núm. 4, pp. 437-458

  2. Upgrading edges in the Graphical TSP

    Computers and Operations Research, Vol. 159

2022

  1. Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem

    Computational Optimization and Applications, Vol. 83, Núm. 1, pp. 67-109

  2. The Profitable Close-Enough Arc Routing Problem

    Computers and Operations Research, Vol. 140

  3. The min-max close-enough arc routing problem

    European Journal of Operational Research, Vol. 300, Núm. 3, pp. 837-851

2021

  1. Arc routing problems: A review of the past, present, and future

    Networks, Vol. 77, Núm. 1, pp. 88-115

  2. On the Distance-Constrained Close Enough Arc Routing Problem

    European Journal of Operational Research, Vol. 291, Núm. 1, pp. 32-51

  3. Solving the length constrained K-drones rural postman problem

    European Journal of Operational Research, Vol. 292, Núm. 1, pp. 60-72

2018

  1. Drone arc routing problems

    Networks, Vol. 72, Núm. 4, pp. 543-559

  2. The Chinese postman problem with load-dependent costs

    Transportation Science, Vol. 52, Núm. 2, pp. 370-385

2017

  1. Aesthetic considerations for the min-max K-Windy Rural Postman Problem

    Networks, Vol. 70, Núm. 3, pp. 216-232

  2. Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem

    EURO Journal on Computational Optimization, Vol. 5, Núm. 3, pp. 339-365

  3. The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm

    European Journal of Operational Research, Vol. 257, Núm. 1, pp. 1-12

  4. The directed profitable rural postman problem with incompatibility constraints

    European Journal of Operational Research, Vol. 261, Núm. 2, pp. 549-562

  5. The hierarchical mixed rural postman problem

    Transportation Science, Vol. 51, Núm. 2, pp. 755-770

2016

  1. A branch-and-cut algorithm for the Orienteering Arc Routing Problem

    Computers and Operations Research, Vol. 66, pp. 95-104

  2. A branch-and-cut algorithm for the profitable windy rural postman problem

    European Journal of Operational Research, Vol. 249, Núm. 3, pp. 1092-1101

  3. A new branch-and-cut algorithm for the generalized directed rural postman problem

    Transportation Science, Vol. 50, Núm. 2, pp. 750-761