default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÁngel Corberán
Person information
- affiliation: University of Valencia, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j56]Á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: 106482 (2024)- 2023
- [j55]Enrique Benavent, Ángel Corberán, Demetrio Laganà, Francesca Vocaturo:
A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs. Eur. J. Oper. Res. 307(1): 64-81 (2023) - [j54]James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura:
The multi-purpose K-drones general routing problem. Networks 82(4): 437-458 (2023) - 2022
- [j53]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): 67-109 (2022) - [j52]Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis:
The Profitable Close-Enough Arc Routing Problem. Comput. Oper. Res. 140: 105653 (2022) - [j51]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): 837-851 (2022) - 2021
- [j50]Á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): 32-51 (2021) - [j49]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): 60-72 (2021) - [j48]Ángel Corberán, Richard Eglese, Geir Hasle, Isaac Plana, José María Sanchis:
Arc routing problems: A review of the past, present, and future. Networks 77(1): 88-115 (2021) - 2020
- [j47]Ángel Corberán, Demetrio Laganà, Francesca Vocaturo:
Preface: Special issue on arc routing problems and other related topics. Networks 76(4): 429-430 (2020) - 2019
- [j46]Enrique Benavent, Ángel Corberán, Demetrio Laganà, Francesca Vocaturo:
The periodic rural postman problem with irregular services on mixed graphs. Eur. J. Oper. Res. 276(3): 826-839 (2019) - [j45]Juanjo Peiró, Ángel Corberán, Rafael Martí, Francisco Saldanha-da-Gama:
Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems. Transp. Sci. 53(4): 1126-1149 (2019) - 2018
- [j44]Juanjo Peiró, Ángel Corberán, Manuel Laguna, Rafael Martí:
Models and solution methods for the uncapacitated r-allocation p-hub equitable center problem. Int. Trans. Oper. Res. 25(4): 1241-1267 (2018) - [j43]James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis:
Drone arc routing problems. Networks 72(4): 543-559 (2018) - [j42]Á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): 370-385 (2018) - 2017
- [j41]Arild Hoff, Juanjo Peiró, Ángel Corberán, Rafael Martí:
Heuristics for the capacitated modular hub location problem. Comput. Oper. Res. 86: 94-109 (2017) - [j40]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): 339-365 (2017) - [j39]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): 1-12 (2017) - [j38]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): 549-562 (2017) - [j37]Ángel Corberán, Maria Cândida Mourão, Leonor Santiago Pinto:
Preface: Special issue on Arc Routing Problems. Networks 70(3): 143 (2017) - [j36]Á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): 216-232 (2017) - [j35]Marco Colombi, Ángel Corberán, Renata Mansini, Isaac Plana, José M. Sanchis:
The Hierarchical Mixed Rural Postman Problem. Transp. Sci. 51(2): 755-770 (2017) - 2016
- [j34]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: 95-104 (2016) - [j33]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): 1092-1101 (2016) - [j32]Ángel Corberán, Juanjo Peiró, Vicente Campos, Fred W. Glover, Rafael Martí:
Strategic oscillation for the capacitated hub location problem with modular links. J. Heuristics 22(2): 221-244 (2016) - [j31]Thais Ávila, Ángel Corberán, Isaac Plana, José María Sanchis:
A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem. Transp. Sci. 50(2): 750-761 (2016) - 2015
- [j30]Rafael Martí, Angel Corberán, Juanjo Peiró:
Scatter search for an uncapacitated p-hub median problem. Comput. Oper. Res. 58: 53-66 (2015) - [j29]Claudia Archetti, Angel Corberán, Isaac Plana, José María Sanchis, M. Grazia Speranza:
A matheuristic for the Team Orienteering Arc Routing Problem. Eur. J. Oper. Res. 245(2): 392-401 (2015) - [j28]Thais Ávila, Angel Corberán, Isaac Plana, José María Sanchis:
The stacker crane problem and the directed general routing problem. Networks 65(1): 43-55 (2015) - 2014
- [j27]Juanjo Peiró, Angel Corberán, Rafael Martí:
GRASP for the uncapacitated r-allocation p-hub median problem. Comput. Oper. Res. 43: 50-60 (2014) - [j26]Enrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis:
A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem. Networks 63(1): 34-45 (2014) - [j25]Claudia Archetti, Maria Grazia Speranza, Angel Corberán, José M. Sanchis, Isaac Plana:
The Team Orienteering Arc Routing Problem. Transp. Sci. 48(3): 442-457 (2014) - 2013
- [j24]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): 21-48 (2013) - 2012
- [j23]Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis:
New results on the Windy Postman Problem. Math. Program. 132(1-2): 309-332 (2012) - 2011
- [j22]Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis:
New facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem. Networks 58(4): 255-272 (2011) - [j21]Angel Corberán, Elena Fernández, Carles Franquesa, José María Sanchis:
The Windy Clustered Prize-Collecting Arc-Routing Problem. Transp. Sci. 45(3): 317-334 (2011) - 2010
- [j20]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): 269-287 (2010) - [j19]Angel Corberán, Christian Prins:
Recent results on Arc Routing Problems: An annotated bibliography. Networks 56(1): 50-69 (2010) - 2009
- [j18]Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis:
Min-Max K-vehicles windy rural postman problem. Networks 54(4): 216-226 (2009) - 2008
- [j17]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): 606-628 (2008) - 2007
- [j16]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): 855-869 (2007) - [j15]Angel Corberán, Isaac Plana, José M. Sanchis:
A branch & cut algorithm for the windy general routing problem and special cases. Networks 49(4): 245-257 (2007) - 2006
- [j14]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): 3384-3402 (2006) - [j13]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): 79-96 (2006) - 2005
- [j12]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: 3111-3128 (2005) - [j11]Angel Corberán, Gustavo Mejía, José M. Sanchis:
New Results on the Mixed General Routing Problem. Oper. Res. 53(2): 363-376 (2005) - 2003
- [j10]Angel Corberán, Antonio Romero, José M. Sanchis:
The mixed general routing polyhedron. Math. Program. 96(1): 103-137 (2003) - [j9]Angel Corberán, Enrique Mota, Juan José Salazar:
Some recent contributions to routing and location problems. Networks 42(2): 109-113 (2003) - 2002
- [j8]Angel Corberán, Rafael Martí, Eulalia Martínez, David Soler:
The Rural Postman Problem on mixed graphs with turn penalties. Comput. Oper. Res. 29(7): 887-903 (2002) - [j7]Angel Corberán, Rafael Martí, José M. Sanchis:
A GRASP heuristic for the mixed Chinese postman problem. Eur. J. Oper. Res. 142(1): 70-80 (2002) - [j6]Ángel Corberán, Elena Fernández, Manuel Laguna, Rafael Martí:
Heuristic solutions to the problem of routing school buses with multiple objectives. J. Oper. Res. Soc. 53(4): 427-435 (2002) - 2001
- [j5]Angel Corberán, Adam N. Letchford, José María Sanchis:
A cutting plane algorithm for the General Routing Problem. Math. Program. 90(2): 291-316 (2001) - 2000
- [j4]Angel Corberán, Rafael Martí, Antonio Romero:
Heuristics for the Mixed Rural Postman Problem. Comput. Oper. Res. 27(2): 183-203 (2000) - 1998
- [j3]P. Augerat, José-Manuel Belenguer, Enrique Benavent, Ángel Corberán, Denis Naddef:
Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. 106(2-3): 546-557 (1998) - [j2]Ángel Corberán, José María Sanchis:
The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra. Eur. J. Oper. Res. 108(3): 538-550 (1998) - 1992
- [j1]Enrique Benavent, Vicente Campos, Angel Corberán, Enrique Mota:
The Capacitated Arc Routing Problem: Lower bounds. Networks 22(7): 669-690 (1992)
Conference and Workshop Papers
- 2012
- [c2]Thais Ávila, Angel Corberán, Isaac Plana, José M. Sanchis:
An ILS-Based Metaheuristic for the Stacker Crane Problem. EvoCOP 2012: 25-36 - 2007
- [c1]Enrique Mota, Vicente Campos, Angel Corberán:
A New Metaheuristic for the Vehicle Routing Problem with Split Demands. EvoCOP 2007: 121-129
Reference Works
- 2018
- [r1]Rafael Martí, Ángel Corberán, Juanjo Peiró:
Scatter Search. Handbook of Heuristics 2018: 717-740
Coauthor Index
aka: José M. Sanchis
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
