default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEnrique Benavent
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]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)
2010 – 2019
- 2019
- [j21]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) - [j20]Jessica Rodríguez-Pereira, Elena Fernández, Gilbert Laporte, Enrique Benavent, Antonio Martinez-Sykora:
The Steiner Traveling Salesman Problem and its extensions. Eur. J. Oper. Res. 278(2): 615-628 (2019) - [j19]Enrique Benavent, Mercedes Landete, Juan José Salazar González, Gregorio Tirado:
The probabilistic pickup-and-delivery travelling salesman problem. Expert Syst. Appl. 121: 313-323 (2019) - 2016
- [j18]José-Manuel Belenguer, Enrique Benavent, Antonio Martínez, Christian Prins, Caroline Prodhon, Juan G. Villegas:
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots. Transp. Sci. 50(2): 735-749 (2016) - 2015
- [j17]Enrique Benavent, Mercedes Landete, Enrique Mota, Gregorio Tirado:
The multiple vehicle pickup and delivery problem with LIFO constraints. Eur. J. Oper. Res. 243(3): 752-762 (2015) - 2014
- [j16]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) - 2013
- [j15]Enrique Benavent, Antonio Martínez:
Multi-depot Multiple TSP: a polyhedral study and computational results. Ann. Oper. Res. 207(1): 7-25 (2013) - 2011
- [j14]José-Manuel Belenguer, Enrique Benavent, Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo:
A Branch-and-Cut method for the Capacitated Location-Routing Problem. Comput. Oper. Res. 38(6): 931-941 (2011) - [j13]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) - 2010
- [j12]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) - [j11]José-Manuel Belenguer, Enrique Benavent, Nacima Labadi, Christian Prins, Mohamed Reghioui:
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic. Transp. Sci. 44(2): 206-220 (2010)
2000 – 2009
- 2009
- [j10]Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis:
Min-Max K-vehicles windy rural postman problem. Networks 54(4): 216-226 (2009) - 2007
- [j9]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) - 2006
- [j8]José-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins:
Lower and upper bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 33(12): 3363-3383 (2006) - 2005
- [j7]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) - 2003
- [j6]José-Manuel Belenguer, Enrique Benavent:
A cutting plane algorithm for the capacitated arc routing problem. Comput. Oper. Res. 30(5): 705-728 (2003)
1990 – 1999
- 1999
- [j5]Enrique Benavent, David Soler:
The Directed Rural Postman Problem with Turn Penalties. Transp. Sci. 33(4): 408-418 (1999) - 1998
- [j4]José-Manuel Belenguer, Enrique Benavent:
The Capacitated Arc Routing Problem: Valid Inequalities and Facets. Comput. Optim. Appl. 10(2): 165-187 (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) - 1992
- [j2]Enrique Benavent, Vicente Campos, Angel Corberán, Enrique Mota:
The Capacitated Arc Routing Problem: Lower bounds. Networks 22(7): 669-690 (1992)
1980 – 1989
- 1989
- [j1]Nicos Christofides, Enrique Benavent:
An Exact Algorithm for the Quadratic Assignment Problem on a Tree. Oper. Res. 37(5): 760-768 (1989)
Coauthor Index
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:32 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:
