GRASP and path relinking for the matrix bandwidth minimization. - Estefanía Piñana; Isaac Plana; Vicente Campos; Rafael Martí (Eur. J. Oper. Res., 2004)

New heuristic algorithms for the windy rural postman problem. - Enrique Benavent; Angel Corberán; Estefanía Piñana; Isaac Plana; José M. Sanchis (Comput. Oper. Res., 2005)

Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems. - Angel Corberán; Isaac Plana; José M. Sanchis (Math. Program., 2006)

A branch & cut algorithm for the windy general routing problem and special cases. - Angel Corberán; Isaac Plana; José M. Sanchis (Networks, 2007)

The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra. - Angel Corberán; Isaac Plana; José M. Sanchis (SIAM J. Discret. Math., 2008)

Min-Max K-vehicles windy rural postman problem. - Enrique Benavent; Angel Corberán; Isaac Plana; José M. Sanchis (Networks, 2009)

New facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem. - Enrique Benavent; Angel Corberán; Isaac Plana; José M. Sanchis (Networks, 2011)

An ILS-Based Metaheuristic for the Stacker Crane Problem. - Thais Ávila; Angel Corberán; Isaac Plana; José M. Sanchis (EvoCOP, 2012)

New results on the Windy Postman Problem. - Angel Corberán; Marcus Oswald; Isaac Plana; Gerhard Reinelt; José M. Sanchis (Math. Program., 2012)

A branch-and-cut algorithm for the maximum benefit Chinese postman problem. - Angel Corberán; Isaac Plana; Antonio M. Rodríguez-Chía; José M. Sanchis (Math. Program., 2013)

A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem. - Enrique Benavent; Angel Corberán; Guy Desaulniers; François Lessard; Isaac Plana; José M. Sanchis (Networks, 2014)

The Team Orienteering Arc Routing Problem. - Claudia Archetti; Maria Grazia Speranza; Angel Corberán; José M. Sanchis; Isaac Plana (Transp. Sci., 2014)

A matheuristic for the Team Orienteering Arc Routing Problem. - Claudia Archetti; Angel Corberán; Isaac Plana; José María Sanchis; M. Grazia Speranza (Eur. J. Oper. Res., 2015)

The stacker crane problem and the directed general routing problem. - Thais Ávila; Angel Corberán; Isaac Plana; José María Sanchis (Networks, 2015)

A branch-and-cut algorithm for the Orienteering Arc Routing Problem. - Claudia Archetti; Ángel Corberán; Isaac Plana; José M. Sanchis; M. Grazia Speranza (Comput. Oper. Res., 2016)

A branch-and-cut algorithm for the profitable windy rural postman problem. - Thais Ávila; Angel Corberán; Isaac Plana; José M. Sanchis (Eur. J. Oper. Res., 2016)

A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem. - Thais Ávila; Ángel Corberán; Isaac Plana; José María Sanchis (Transp. Sci., 2016)

Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. - Thais Ávila; Ángel Corberán; Isaac Plana; José M. Sanchis (EURO J. Comput. Optim., 2017)

The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm. - Marco Colombi; Ángel Corberán; Renata Mansini; Isaac Plana; José M. Sanchis (Eur. J. Oper. Res., 2017)

The directed profitable rural postman problem with incompatibility constraints. - Marco Colombi; Ángel Corberán; Renata Mansini; Isaac Plana; José M. Sanchis (Eur. J. Oper. Res., 2017)

Aesthetic considerations for the min-max K-Windy Rural Postman Problem. - Ángel Corberán; Bruce L. Golden; Oliver Lum; Isaac Plana; José M. Sanchis (Networks, 2017)

The Hierarchical Mixed Rural Postman Problem. - Marco Colombi; Ángel Corberán; Renata Mansini; Isaac Plana; José M. Sanchis (Transp. Sci., 2017)

Drone arc routing problems. - James F. Campbell; Ángel Corberán; Isaac Plana; José M. Sanchis (Networks, 2018)

The Chinese Postman Problem with Load-Dependent Costs. - Ángel Corberán; Günes Erdogan; Gilbert Laporte; Isaac Plana; José M. Sanchis (Transp. Sci., 2018)

Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm. - Anna Arigliano; Gianpaolo Ghiani; Antonio Grieco; Emanuela Guerriero; Isaac Plana (Discret. Appl. Math., 2019)

Solving the length constrained K-drones rural postman problem. - James F. Campbell; Ángel Corberán; Isaac Plana; José M. Sanchis; Paula Segura (Eur. J. Oper. Res., 2021)

On the Distance-Constrained Close Enough Arc Routing Problem. - Ángel Corberán; Isaac Plana; Miguel Reula; José M. Sanchis (Eur. J. Oper. Res., 2021)

Arc routing problems: A review of the past, present, and future. - Ángel Corberán; Richard Eglese; Geir Hasle; Isaac Plana; José María Sanchis (Networks, 2021)

Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem. - James F. Campbell; Ángel Corberán; Isaac Plana; José M. Sanchis; Paula Segura (Comput. Optim. Appl., 2022)

The Profitable Close-Enough Arc Routing Problem. - Nicola Bianchessi; Ángel Corberán; Isaac Plana; Miguel Reula; José M. Sanchis (Comput. Oper. Res., 2022)

The min-max close-enough arc routing problem. - Nicola Bianchessi; Ángel Corberán; Isaac Plana; Miguel Reula; José M. Sanchis (Eur. J. Oper. Res., 2022)

Upgrading edges in the Graphical TSP. - Mercedes Landete; Isaac Plana; José Luis Sainz-Pardo; José María Sanchis (Comput. Oper. Res., 2023)

The multi-purpose K-drones general routing problem. - James F. Campbell; Ángel Corberán; Isaac Plana; José M. Sanchis; Paula Segura (Networks, 2023)

Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem. - Ángel Corberán; Isaac Plana; José M. Sanchis; Paula Segura (Comput. Oper. Res., 2024)

The min max multi-trip drone location arc routing problem. - Teresa Corberán; Isaac Plana; José María Sanchis (Comput. Oper. Res., 2025)