Conjunts de dades


Articles en revistes

  • J.M. Belenguer, E. Benavent (1998).
    The Capacitated Arc Routing Problem: Valid inequalities and facets.
    Computational Optimization and Applications 10(2), pp. 165-187, doi: 10.1023/A:1018316919294.
    doi     bibtex

  • P. Augerat, J.M. Belenguer, E. Benavent, A. Corberán, D. Naddef (1998).
    Separating capacity constraints in the CVRP using tabu search.
    European Journal of Operational Research 106(2-3), pp. 546-557, doi: 10.1016/S0377-2217(97)00290-7 .
    doi     bibtex

  • J.M. Belenguer, M.C. Martínez, E. Mota (2000).
    A Lower Bound for the Split Delivery Vehicle Routing Problem.
    Operations Research 48(5), pp. 801-810, doi: 10.1287/opre.48.5.801.12407.
    doi     bibtex

  • J.M. Belenguer, E. Benavent (2003).
    A Cutting Plane Algorithm for the Capacitated Arc Routing Problem.
    Computers & Operations Research 30(5), pp. 705-728, doi: 10.1016/S0305-0548(02)00046-1.
    doi     bibtex

  • J.M. Belenguer, E. Benavent, M.C. Martínez (2005).
    RutaRep: A Computer Package to Design Dispatching Routes in the Meat Industry.
    Journal of Food Engineering 70(3), pp. 435-445. doi: 10.1016/j.jfoodeng.2004.02.045.
    doi     bibtex

  • J.M. Belenguer, E. Benavent, P. Lacomme, C. Prins (2006).
    Heuristics and Lower Bound for the Mixed Capacitated Arc Routing Problem,
    Computers & Operations Research 33(12), pp. 3363-3383, doi: 10.1016/j.cor.2005.02.009.
    doi     bibtex

  • J.M. Belenguer, E. Benavent, N. Labadi, C. Prins, M. Reghioui (2010).
    Split-delivery capacitated arc-routing problem: Lower bound and metaheuristic.
    Transportation Science 44(2), pp. 206-220, doi: 10.1287/trsc.1090.0305.
    doi     bibtex

  • J.M. Belenguer, E. Benavent, C. Prins, C. Prodhon, R. Wolfler-Calvo (2011).
    A Branch-and-Cut method for the Capacitated Location-Routing Problem.
    Computers & Operations Research 38(6), pp. 931-941, doi: 10.1016/j.cor.2010.09.019.
    doi     bibtex

  • J.M. Belenguer, E. Benavent, A. Martínez, C. Prins, C. Prohon, J. G. Villegas (2014). (Forthcoming)
    A branch-and-cut algorithm for the single truck and trailer routing problem with satellite depots.
    Transportation Science, doi: 10.1287/trsc.2014.0571. (Aceptat en Agost 2014, on line en Abril 2015).
    doi     bibtex

  • R. Álvarez-Valdés, J.M. Belenguer, E. Benavent, J.D. Bermúdez, F. Muñoz, E. Vercher, F. Verdejo (2015). (Forthcoming)
    Optimizing the level of service quality of a bike-sharing system.
    Omega, doi: 10.1016/ (Aceptat en Setembre 2015, on line en Octubre 2015).
    doi     bibtex

Capítols en llibres

  • J.M. Belenguer, E. Benavent, S. Irnich (2014).
    The Capacitated Arc-Routing Problem: Exact Methods
    In: Á. Corberán and G. Laporte (eds.), Arc Routing: Problems, Methods, and Applications, MOS-SIAM Series on Optimization. Chapter 9, pp. 183-221, doi: 10.1137/1.9781611973679.ch9. SIAM, Philadelphia.
    doi     bibtex

Technical reports

  • P. Augerat, J.M. Belenguer, E. Benavent, A. Corberán, D. Naddef, G. Rinaldi (1995)
    Computational results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem
    Technical Report RR 949- M. Univ. Joseph Fourier. Grenoble, France.
    pdf     bibtex

Última actualització: 10 d'Octubre de 2015