( en | de | ru )

 

Disambiguation of "Plana, Isaac"

Author of the publication

copydeleteadd this publication to your clipboard
The min-max close-enough arc routing problem.

, , , , and . Eur. J. Oper. Res., 300 (3): 837-851 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Isaac

Juliana Plana Borrás

Lara Planas Paz

Emmanuel Planas

Otto Isaac

 

Other publications of authors with the same name

Drone arc routing problems., , , and . Networks, 72 (4): 543-559 (2018)A branch-and-cut algorithm for the maximum benefit Chinese postman problem., , , and . Math. Program., 141 (1-2): 21-48 (2013)A matheuristic for the Team Orienteering Arc Routing Problem., , , , and . Eur. J. Oper. Res., 245 (2): 392-401 (2015)The min-max close-enough arc routing problem., , , , and . Eur. J. Oper. Res., 300 (3): 837-851 (2022)New heuristic algorithms for the windy rural postman problem., , , , and . Comput. Oper. Res., (2005)Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem., , , and . Comput. Oper. Res., (February 2024)GRASP and path relinking for the matrix bandwidth minimization., , , and . Eur. J. Oper. Res., 153 (1): 200-210 (2004)The directed profitable rural postman problem with incompatibility constraints., , , , and . Eur. J. Oper. Res., 261 (2): 549-562 (2017)Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm., , , , and . Discret. Appl. Math., (2019)The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm., , , , and . Eur. J. Oper. Res., 257 (1): 1-12 (2017)