Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Enrique Benavent
@article{DBLP:journals/eor/BenaventCLV23,
author = {Enrique Benavent and
{\'{A}}ngel Corber{\'{a}}n and
Demetrio Lagan{\`{a}} and
Francesca Vocaturo},
title = {A two-phase hybrid algorithm for the periodic rural postman problem
with irregular services on mixed graphs},
journal = {Eur. J. Oper. Res.},
volume = {307},
number = {1},
pages = {64--81},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2022.09.026},
doi = {10.1016/J.EJOR.2022.09.026},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BenaventCLV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BenaventCLV19,
author = {Enrique Benavent and
{\'{A}}ngel Corber{\'{a}}n and
Demetrio Lagan{\`{a}} and
Francesca Vocaturo},
title = {The periodic rural postman problem with irregular services on mixed
graphs},
journal = {Eur. J. Oper. Res.},
volume = {276},
number = {3},
pages = {826--839},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2019.01.056},
doi = {10.1016/J.EJOR.2019.01.056},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BenaventCLV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Rodriguez-Pereira19,
author = {Jessica Rodr{\'{\i}}guez{-}Pereira and
Elena Fern{\'{a}}ndez and
Gilbert Laporte and
Enrique Benavent and
Antonio Martinez{-}Sykora},
title = {The Steiner Traveling Salesman Problem and its extensions},
journal = {Eur. J. Oper. Res.},
volume = {278},
number = {2},
pages = {615--628},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2019.04.047},
doi = {10.1016/J.EJOR.2019.04.047},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/Rodriguez-Pereira19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eswa/BenaventLST19,
author = {Enrique Benavent and
Mercedes Landete and
Juan Jos{\'{e}} Salazar Gonz{\'{a}}lez and
Gregorio Tirado},
title = {The probabilistic pickup-and-delivery travelling salesman problem},
journal = {Expert Syst. Appl.},
volume = {121},
pages = {313--323},
year = {2019},
url = {https://doi.org/10.1016/j.eswa.2018.12.028},
doi = {10.1016/J.ESWA.2018.12.028},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eswa/BenaventLST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/BelenguerBMPPV16,
author = {Jos{\'{e}}{-}Manuel Belenguer and
Enrique Benavent and
Antonio Mart{\'{\i}}nez and
Christian Prins and
Caroline Prodhon and
Juan G. Villegas},
title = {A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing
Problem with Satellite Depots},
journal = {Transp. Sci.},
volume = {50},
number = {2},
pages = {735--749},
year = {2016},
url = {https://doi.org/10.1287/trsc.2014.0571},
doi = {10.1287/TRSC.2014.0571},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/BelenguerBMPPV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BenaventLMT15,
author = {Enrique Benavent and
Mercedes Landete and
Enrique Mota and
Gregorio Tirado},
title = {The multiple vehicle pickup and delivery problem with {LIFO} constraints},
journal = {Eur. J. Oper. Res.},
volume = {243},
number = {3},
pages = {752--762},
year = {2015},
url = {https://doi.org/10.1016/j.ejor.2014.12.029},
doi = {10.1016/J.EJOR.2014.12.029},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BenaventLMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BenaventCDLPS14,
author = {Enrique Benavent and
Angel Corber{\'{a}}n and
Guy Desaulniers and
Fran{\c{c}}ois Lessard and
Isaac Plana and
Jos{\'{e}} M. Sanchis},
title = {A branch-price-and-cut algorithm for the min-max \emph{k}-vehicle
windy rural postman problem},
journal = {Networks},
volume = {63},
number = {1},
pages = {34--45},
year = {2014},
url = {https://doi.org/10.1002/net.21520},
doi = {10.1002/NET.21520},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BenaventCDLPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BenaventM13,
author = {Enrique Benavent and
Antonio Mart{\'{\i}}nez},
title = {Multi-depot Multiple {TSP:} a polyhedral study and computational results},
journal = {Ann. Oper. Res.},
volume = {207},
number = {1},
pages = {7--25},
year = {2013},
url = {https://doi.org/10.1007/s10479-011-1024-y},
doi = {10.1007/S10479-011-1024-Y},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/BenaventM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BelenguerBPPC11,
author = {Jos{\'{e}}{-}Manuel Belenguer and
Enrique Benavent and
Christian Prins and
Caroline Prodhon and
Roberto Wolfler Calvo},
title = {A Branch-and-Cut method for the Capacitated Location-Routing Problem},
journal = {Comput. Oper. Res.},
volume = {38},
number = {6},
pages = {931--941},
year = {2011},
url = {https://doi.org/10.1016/j.cor.2010.09.019},
doi = {10.1016/J.COR.2010.09.019},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BelenguerBPPC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BenaventCPS11,
author = {Enrique Benavent and
Angel Corber{\'{a}}n and
Isaac Plana and
Jos{\'{e}} M. Sanchis},
title = {New facets and an enhanced branch-and-cut for the min-max \emph{K}-vehicles
windy rural postman problem},
journal = {Networks},
volume = {58},
number = {4},
pages = {255--272},
year = {2011},
url = {https://doi.org/10.1002/net.20469},
doi = {10.1002/NET.20469},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BenaventCPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cms/BenaventCS10,
author = {Enrique Benavent and
{\'{A}}ngel Corber{\'{a}}n and
Jos{\'{e}} M. Sanchis},
title = {A metaheuristic for the min-max windy rural postman problem with {K}
vehicles},
journal = {Comput. Manag. Sci.},
volume = {7},
number = {3},
pages = {269--287},
year = {2010},
url = {https://doi.org/10.1007/s10287-009-0119-2},
doi = {10.1007/S10287-009-0119-2},
timestamp = {Sun, 10 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cms/BenaventCS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/BelenguerBLPR10,
author = {Jos{\'{e}}{-}Manuel Belenguer and
Enrique Benavent and
Nacima Labadi and
Christian Prins and
Mohamed Reghioui},
title = {Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic},
journal = {Transp. Sci.},
volume = {44},
number = {2},
pages = {206--220},
year = {2010},
url = {https://doi.org/10.1287/trsc.1090.0305},
doi = {10.1287/TRSC.1090.0305},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/BelenguerBLPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BenaventCPS09,
author = {Enrique Benavent and
Angel Corber{\'{a}}n and
Isaac Plana and
Jos{\'{e}} M. Sanchis},
title = {Min-Max \emph{K}-vehicles windy rural postman problem},
journal = {Networks},
volume = {54},
number = {4},
pages = {216--226},
year = {2009},
url = {https://doi.org/10.1002/net.20334},
doi = {10.1002/NET.20334},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BenaventCPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/BenaventCCSV07,
author = {Enrique Benavent and
Alessandro Carrotta and
Angel Corber{\'{a}}n and
Jos{\'{e}} M. Sanchis and
Daniele Vigo},
title = {Lower bounds and heuristics for the Windy Rural Postman Problem},
journal = {Eur. J. Oper. Res.},
volume = {176},
number = {2},
pages = {855--869},
year = {2007},
url = {https://doi.org/10.1016/j.ejor.2005.09.021},
doi = {10.1016/J.EJOR.2005.09.021},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/BenaventCCSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BelenguerBLP06,
author = {Jos{\'{e}}{-}Manuel Belenguer and
Enrique Benavent and
Philippe Lacomme and
Christian Prins},
title = {Lower and upper bounds for the mixed capacitated arc routing problem},
journal = {Comput. Oper. Res.},
volume = {33},
number = {12},
pages = {3363--3383},
year = {2006},
url = {https://doi.org/10.1016/j.cor.2005.02.009},
doi = {10.1016/J.COR.2005.02.009},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BelenguerBLP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BenaventCPPS05,
author = {Enrique Benavent and
Angel Corber{\'{a}}n and
Estefan{\'{\i}}a Pi{\~{n}}ana and
Isaac Plana and
Jos{\'{e}} M. Sanchis},
title = {New heuristic algorithms for the windy rural postman problem},
journal = {Comput. Oper. Res.},
volume = {32},
pages = {3111--3128},
year = {2005},
url = {https://doi.org/10.1016/j.cor.2004.04.007},
doi = {10.1016/J.COR.2004.04.007},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BenaventCPPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/BelenguerB03,
author = {Jos{\'{e}}{-}Manuel Belenguer and
Enrique Benavent},
title = {A cutting plane algorithm for the capacitated arc routing problem},
journal = {Comput. Oper. Res.},
volume = {30},
number = {5},
pages = {705--728},
year = {2003},
url = {https://doi.org/10.1016/S0305-0548(02)00046-1},
doi = {10.1016/S0305-0548(02)00046-1},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/BelenguerB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/transci/BenaventS99,
author = {Enrique Benavent and
David Soler},
title = {The Directed Rural Postman Problem with Turn Penalties},
journal = {Transp. Sci.},
volume = {33},
number = {4},
pages = {408--418},
year = {1999},
url = {https://doi.org/10.1287/trsc.33.4.408},
doi = {10.1287/TRSC.33.4.408},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/transci/BenaventS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/BelenguerB98,
author = {Jos{\'{e}}{-}Manuel Belenguer and
Enrique Benavent},
title = {The Capacitated Arc Routing Problem: Valid Inequalities and Facets},
journal = {Comput. Optim. Appl.},
volume = {10},
number = {2},
pages = {165--187},
year = {1998},
url = {https://doi.org/10.1023/A:1018316919294},
doi = {10.1023/A:1018316919294},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/BelenguerB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/AugeratBBCN98,
author = {P. Augerat and
Jos{\'{e}}{-}Manuel Belenguer and
Enrique Benavent and
{\'{A}}ngel Corber{\'{a}}n and
Denis Naddef},
title = {Separating capacity constraints in the {CVRP} using tabu search},
journal = {Eur. J. Oper. Res.},
volume = {106},
number = {2-3},
pages = {546--557},
year = {1998},
url = {https://doi.org/10.1016/S0377-2217(97)00290-7},
doi = {10.1016/S0377-2217(97)00290-7},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/AugeratBBCN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BenaventCCM92,
author = {Enrique Benavent and
Vicente Campos and
Angel Corber{\'{a}}n and
Enrique Mota},
title = {The Capacitated Arc Routing Problem: Lower bounds},
journal = {Networks},
volume = {22},
number = {7},
pages = {669--690},
year = {1992},
url = {https://doi.org/10.1002/net.3230220706},
doi = {10.1002/NET.3230220706},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BenaventCCM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/ChristofidesB89,
author = {Nicos Christofides and
Enrique Benavent},
title = {An Exact Algorithm for the Quadratic Assignment Problem on a Tree},
journal = {Oper. Res.},
volume = {37},
number = {5},
pages = {760--768},
year = {1989},
url = {https://doi.org/10.1287/opre.37.5.760},
doi = {10.1287/OPRE.37.5.760},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/ChristofidesB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-11-14 01:50 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:
