José M. Sanchis

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 16

Top Topics

Benders Decomposition

Routing Problem

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Publications

Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura
Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem. Comput. Oper. Res. 162 (2024)
James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura
-drones general routing problem. Networks 82 (4) (2023)
Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
The Profitable Close-Enough Arc Routing Problem. Comput. Oper. Res. 140 (2022)
Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
The min-max close-enough arc routing problem. Eur. J. Oper. Res. 300 (3) (2022)
James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura
Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem. Comput. Optim. Appl. 83 (1) (2022)
Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
On the Distance-Constrained Close Enough Arc Routing Problem. Eur. J. Oper. Res. 291 (1) (2021)
James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura
Solving the length constrained K-drones rural postman problem. Eur. J. Oper. Res. 292 (1) (2021)
Ángel Corberán, Günes Erdogan, Gilbert Laporte, Isaac Plana, José M. Sanchis
The Chinese Postman Problem with Load-Dependent Costs. Transp. Sci. 52 (2) (2018)
James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis
Drone arc routing problems. Networks 72 (4) (2018)
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
The directed profitable rural postman problem with incompatibility constraints. Eur. J. Oper. Res. 261 (2) (2017)
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
The Hierarchical Mixed Rural Postman Problem. Transp. Sci. 51 (2) (2017)
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm. Eur. J. Oper. Res. 257 (1) (2017)
Ángel Corberán, Bruce L. Golden, Oliver Lum, Isaac Plana, José M. Sanchis
Aesthetic considerations for the min-max K-Windy Rural Postman Problem. Networks 70 (3) (2017)
Thais Ávila, Ángel Corberán, Isaac Plana, José M. Sanchis
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem. EURO J. Comput. Optim. 5 (3) (2017)
Claudia Archetti, Ángel Corberán, Isaac Plana, José M. Sanchis, M. Grazia Speranza
A branch-and-cut algorithm for the Orienteering Arc Routing Problem. Comput. Oper. Res. 66 (2016)
Thais Ávila, Angel Corberán, Isaac Plana, José M. Sanchis
A branch-and-cut algorithm for the profitable windy rural postman problem. Eur. J. Oper. Res. 249 (3) (2016)
Enrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis
-vehicle windy rural postman problem. Networks 63 (1) (2014)
Claudia Archetti, Maria Grazia Speranza, Angel Corberán, José M. Sanchis, Isaac Plana
The Team Orienteering Arc Routing Problem. Transp. Sci. 48 (3) (2014)
Angel Corberán, Isaac Plana, Antonio M. Rodríguez-Chía, José M. Sanchis
A branch-and-cut algorithm for the maximum benefit Chinese postman problem. Math. Program. 141 (1-2) (2013)
Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis
New results on the Windy Postman Problem. Math. Program. 132 (1-2) (2012)
Thais Ávila, Angel Corberán, Isaac Plana, José M. Sanchis
An ILS-Based Metaheuristic for the Stacker Crane Problem. EvoCOP (2012)
Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis
-vehicles windy rural postman problem. Networks 58 (4) (2011)
Enrique Benavent, Ángel Corberán, José M. Sanchis
A metaheuristic for the min-max windy rural postman problem with K vehicles. Comput. Manag. Sci. 7 (3) (2010)
Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis
-vehicles windy rural postman problem. Networks 54 (4) (2009)
Angel Corberán, Isaac Plana, José M. Sanchis
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra. SIAM J. Discret. Math. 22 (2) (2008)
Angel Corberán, Isaac Plana, José M. Sanchis
A branch & cut algorithm for the windy general routing problem and special cases. Networks 49 (4) (2007)
Enrique Benavent, Alessandro Carrotta, Angel Corberán, José M. Sanchis, Daniele Vigo
Lower bounds and heuristics for the Windy Rural Postman Problem. Eur. J. Oper. Res. 176 (2) (2007)
Angel Corberán, Enrique Mota, José M. Sanchis
A comparison of two different formulations for arc routing problems on mixed graphs. Comput. Oper. Res. 33 (12) (2006)
Angel Corberán, Isaac Plana, José M. Sanchis
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems. Math. Program. 108 (1) (2006)
Angel Corberán, Gustavo Mejía, José M. Sanchis
New Results on the Mixed General Routing Problem. Oper. Res. 53 (2) (2005)
Enrique Benavent, Angel Corberán, Estefanía Piñana, Isaac Plana, José M. Sanchis
New heuristic algorithms for the windy rural postman problem. Comput. Oper. Res. 32 (2005)
Angel Corberán, Antonio Romero, José M. Sanchis
The mixed general routing polyhedron. Math. Program. 96 (1) (2003)
Angel Corberán, Rafael Martí, José M. Sanchis
A GRASP heuristic for the mixed Chinese postman problem. Eur. J. Oper. Res. 142 (1) (2002)
Pedro Fernández de Córdoba, Lluís Miquel Garcia-Raffi, José M. Sanchis
A heuristic algorithm based on Monte Carlo methods for the rural postman problem. Comput. Oper. Res. 25 (12) (1998)