José María Sanchis

According to our database, José María Sanchis authored at least 43 papers between 1998 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

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., February, 2024

2023

The multi-purpose <i>K</i>-drones general routing problem.

James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura

Networks, December, 2023

Upgrading edges in the Graphical TSP.

Mercedes Landete, Isaac Plana, José Luis Sainz-Pardo, José María Sanchis

Comput. Oper. Res., November, 2023

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

The Profitable Close-Enough Arc Routing Problem.

Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis

Comput. Oper. Res., 2022

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

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

On the Distance-Constrained Close Enough Arc Routing Problem.

Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis

Eur. J. Oper. Res., 2021

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

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

Drone arc routing problems.

James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis

Networks, 2018

2017

The Hierarchical Mixed Rural Postman Problem.

Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis

Transp. Sci., 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 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

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

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

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

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 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

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 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

2014

The Team Orienteering Arc Routing Problem.

Claudia Archetti, Maria Grazia Speranza, Angel Corberán, José M. Sanchis, Isaac Plana

Transp. Sci., 2014

A branch-price-and-cut algorithm for the min-max <i>k</i>-vehicle windy rural postman problem.

Enrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis

Networks, 2014

2013

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

2012

New results on the Windy Postman Problem.

Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis

Math. Program., 2012

An ILS-Based Metaheuristic for the Stacker Crane Problem.

Thais Ávila, Angel Corberán, Isaac Plana, José M. Sanchis

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2012

2011

The Windy Clustered Prize-Collecting Arc-Routing Problem.

Angel Corberán, Elena Fernández, Carles Franquesa, José María Sanchis

Transp. Sci., 2011

New facets and an enhanced branch-and-cut for the min-max <i>K</i>-vehicles windy rural postman problem.

Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis

Networks, 2011

2010

A metaheuristic for the min-max windy rural postman problem with K vehicles.

Enrique Benavent, Ángel Corberán, José M. Sanchis

Comput. Manag. Sci., 2010

2009

Min-Max <i>K</i>-vehicles windy rural postman problem.

Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis

Networks, 2009

2008

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

An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation.

José Albiach, José María Sanchis, David Soler

Eur. J. Oper. Res., 2008

2007

A branch & cut algorithm for the windy general routing problem and special cases.

Angel Corberán, Isaac Plana, José M. Sanchis

Networks, 2007

Lower bounds and heuristics for the Windy Rural Postman Problem.

Enrique Benavent, Alessandro Carrotta, Angel Corberán, José M. Sanchis, Daniele Vigo

Eur. J. Oper. Res., 2007

2006

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 comparison of two different formulations for arc routing problems on mixed graphs.

Angel Corberán, Enrique Mota, José M. Sanchis

Comput. Oper. Res., 2006

2005

New Results on the Mixed General Routing Problem.

Angel Corberán, Gustavo Mejía, José M. Sanchis

Oper. Res., 2005

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

2003

The mixed general routing polyhedron.

Angel Corberán, Antonio Romero, José M. Sanchis

Math. Program., 2003

2002

A GRASP heuristic for the mixed Chinese postman problem.

Angel Corberán, Rafael Martí, José M. Sanchis

Eur. J. Oper. Res., 2002

2001

A cutting plane algorithm for the General Routing Problem.

Angel Corberán, Adam N. Letchford, José María Sanchis

Math. Program., 2001

1998

The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra.

Ángel Corberán, José María Sanchis

Eur. J. Oper. Res., 1998

A heuristic algorithm based on Monte Carlo methods for the rural postman problem.

Pedro Fernández de Córdoba, Lluís Miquel Garcia-Raffi, José M. Sanchis

Comput. Oper. Res., 1998