Up a level |
Costa, L., Lust, T., Kramer, R., & Subramanian, A. (2018). A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem. Networks, 72(3), 311-336. External link
Kramer, R., Iori, M., & Vidal, T. (2020). Mathematical Models and Search Algorithms for the Capacitated p-Center Problem. INFORMS Journal on Computing, 32(2), 444-460. External link
Kramer, R., Subramanian, A., Vidal, T., & Cabral, L. A. F. (2015). A matheuristic approach for the Pollution-Routing Problem. European Journal of Operational Research, 243(2), 523-539. External link
Kramer, R., Maculan, N., Subramanian, A., & Vidal, T. (2015). A speed and departure time optimization algorithm for the pollution-routing problem. European Journal of Operational Research, 247(3), 782-787. External link