Up a level |
This graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
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., 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
Mecler, J., Subramanian, A., & Vidal, T. (2021). A simple and effective hybrid genetic search for the job sequencing and tool switching problem. Computers & Operations Research, 127, 105153-105153. External link
Masson, R., Vidal, T., Michallet, J., Penna, P. H. V., Petrucci, V., Subramanian, A., & Dubedout, H. (2013). An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Systems With Applications, 40(13), 5266-5275. External link
Masson, R., Vidal, T., Michallet, J., Vaz Penna Puca, H., Petrucci, V., Subramanian, A., & Dubedout, H. (2012). An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. (Technical Report n° CIRRELT-2012-70). External link
Pacheco, T., Martinelli, R., Subramanian, A., Toffolo, T. A. M., & Vidal, T. (2023). Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem. Transportation Science, 57(2), 463-481. External link
Penna, P. H. V., Subramanian, A., Ochi, L. S., Vidal, T., & Prins, C. (2019). A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Annals of Operations Research, 273(1), 5-74. External link
Queiroga, E., Frota, Y., Sadykov, R., Subramanian, A., Uchoa, E., & Vidal, T. (2020). On the exact solution of vehicle routing problems with backhauls. European Journal of Operational Research, 287(1), 76-89. External link
Silva, M. M., Subramanian, A., Vidal, T., & Ochi, L. S. (2012). A simple and effective metaheuristic for the Minimum Latency Problem. European Journal of Operational Research, 221(3), 513-520. External link
Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., & Subramanian, A. (2017). New benchmark instances for the Capacitated Vehicle Routing Problem. European Journal of Operational Research, 257(3), 845-858. External link
Vidal, T., Battarra, M., Subramanian, A., & Erdogˇan, G. (2015). Hybrid metaheuristics for the Clustered Vehicle Routing Problem. Computers & Operations Research, 58, 87-99. External link