José M. Sanchis

35 papers B 1Journal 34
YearRankTypeTitle / Venue / Authors
2025 J jnl
The multidepot drone general routing problem with duration and capacity constraints.
Int. Trans. Oper. Res.
Teresa Corberán, Isaac Plana, José M. Sanchis, Paula Segura
2024 J jnl
Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem.
Comput. Oper. Res.
Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura
2023 J jnl
The multi-purpose
Networks
James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura
2022 J jnl
Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem.
Comput. Optim. Appl.
James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura
2022 J jnl
The Profitable Close-Enough Arc Routing Problem.
Comput. Oper. Res.
Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
2022 J jnl
The min-max close-enough arc routing problem.
Eur. J. Oper. Res.
Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
2021 J jnl
On the Distance-Constrained Close Enough Arc Routing Problem.
Eur. J. Oper. Res.
Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
2021 J jnl
Solving the length constrained K-drones rural postman problem.
Eur. J. Oper. Res.
James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura
2018 J jnl
Drone arc routing problems.
Networks
James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis
2018 J jnl
The Chinese Postman Problem with Load-Dependent Costs.
Transp. Sci.
Ángel Corberán, Günes Erdogan, Gilbert Laporte, Isaac Plana, José M. Sanchis
2017 J jnl
Aesthetic considerations for the min-max K-Windy Rural Postman Problem.
Networks
Ángel Corberán, Bruce L. Golden, Oliver Lum, Isaac Plana, José M. Sanchis
2017 J jnl
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem.
EURO J. Comput. Optim.
Thais Ávila, Ángel Corberán, Isaac Plana, José M. Sanchis
2017 J jnl
The Hierarchical Mixed Rural Postman Problem.
Transp. Sci.
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
2017 J jnl
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm.
Eur. J. Oper. Res.
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
2017 J jnl
The directed profitable rural postman problem with incompatibility constraints.
Eur. J. Oper. Res.
Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis
2016 J jnl
A branch-and-cut algorithm for the Orienteering Arc Routing Problem.
Comput. Oper. Res.
Claudia Archetti, Ángel Corberán, Isaac Plana, José M. Sanchis, M. Grazia Speranza
2016 J jnl
A branch-and-cut algorithm for the profitable windy rural postman problem.
Eur. J. Oper. Res.
Thais Ávila, Angel Corberán, Isaac Plana, José M. Sanchis
2014 J jnl
A branch-price-and-cut algorithm for the min-max
Networks
Enrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis
2014 J jnl
The Team Orienteering Arc Routing Problem.
Transp. Sci.
Claudia Archetti, Maria Grazia Speranza, Angel Corberán, José M. Sanchis, Isaac Plana
2013 J jnl
A branch-and-cut algorithm for the maximum benefit Chinese postman problem.
Math. Program.
Angel Corberán, Isaac Plana, Antonio M. Rodríguez-Chía, José M. Sanchis
2012 B conf
An ILS-Based Metaheuristic for the Stacker Crane Problem.
EvoCOP
Thais Ávila, Angel Corberán, Isaac Plana, José M. Sanchis
2012 J jnl
New results on the Windy Postman Problem.
Math. Program.
Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis
2011 J jnl
New facets and an enhanced branch-and-cut for the min-max
Networks
Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis
2010 J jnl
A metaheuristic for the min-max windy rural postman problem with K vehicles.
Comput. Manag. Sci.
Enrique Benavent, Ángel Corberán, José M. Sanchis
2009 J jnl
Min-Max
Networks
Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis
2008 J jnl
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra.
SIAM J. Discret. Math.
Angel Corberán, Isaac Plana, José M. Sanchis
2007 J jnl
A branch & cut algorithm for the windy general routing problem and special cases.
Networks
Angel Corberán, Isaac Plana, José M. Sanchis
2007 J jnl
Lower bounds and heuristics for the Windy Rural Postman Problem.
Eur. J. Oper. Res.
Enrique Benavent, Alessandro Carrotta, Angel Corberán, José M. Sanchis, Daniele Vigo
2006 J jnl
A comparison of two different formulations for arc routing problems on mixed graphs.
Comput. Oper. Res.
Angel Corberán, Enrique Mota, José M. Sanchis
2006 J jnl
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems.
Math. Program.
Angel Corberán, Isaac Plana, José M. Sanchis
2005 J jnl
New Results on the Mixed General Routing Problem.
Oper. Res.
Angel Corberán, Gustavo Mejía, José M. Sanchis
2005 J jnl
New heuristic algorithms for the windy rural postman problem.
Comput. Oper. Res.
Enrique Benavent, Angel Corberán, Estefanía Piñana, Isaac Plana, José M. Sanchis
2003 J jnl
The mixed general routing polyhedron.
Math. Program.
Angel Corberán, Antonio Romero, José M. Sanchis
2002 J jnl
A GRASP heuristic for the mixed Chinese postman problem.
Eur. J. Oper. Res.
Angel Corberán, Rafael Martí, José M. Sanchis
1998 J jnl
A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
Comput. Oper. Res.
Pedro Fernández de Córdoba, Lluís Miquel Garcia-Raffi, José M. Sanchis