Telmo Pinto

Orcid: 0000-0003-1087-7941

Affiliations:
  • University of Coimbra, Portugal
  • University of Minho, Braga, Portugal (PhD 2016)


According to our database1, Telmo Pinto authored at least 16 papers between 2012 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Innovative hybrid kitting systems for automotive manufacturing: performance analysis and optimisation.
Int. J. Prod. Res., 2025

Are Vehicle Routing Problems Truly Well-Known?
Proceedings of the 14th International Conference on Operations Research and Enterprise Systems, 2025

Mixed-Integer Multi-objective Programming for Intermodal Supply Chain Design.
Proceedings of the Computational Science and Its Applications - ICCSA 2025 Workshops - Istanbul, Turkey, June 30, 2025

2023
Solving the integrated planning and scheduling problem using variable neighborhood search based algorithms.
Expert Syst. Appl., October, 2023

Optimization of the Energy Consumption for Robotic Kitting in the Automotive Industry.
Proceedings of the Robot 2023: Sixth Iberian Robotics Conference, 2023

The Consistent Vehicle Routing Problem: An Application to the Pharmaceutical Supply Chain.
Proceedings of the Optimization, Learning Algorithms and Applications, 2023

An Exact Optimization Approach for Personnel Scheduling Problems in the Call Center Industry.
Proceedings of the Computational Science and Its Applications - ICCSA 2023 Workshops, 2023

2021
A Two-Stage Heuristic for a Real Multi-compartment and Multi-trip Vehicle Routing Problem with Time Windows.
Proceedings of the Computational Science and Its Applications - ICCSA 2021, 2021

2020
Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls.
Int. Trans. Oper. Res., 2020

2018
Column generation based primal heuristics for routing and loading problems.
Electron. Notes Discret. Math., 2018

2017
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints.
Electron. Notes Discret. Math., 2017

Variable Neighborhood Search for Integrated Planning and Scheduling.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016
A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints.
Proceedings of the Computational Logistics - 7th International Conference, 2016

2015
Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

2012
New constructive algorithms for leather nesting in the automotive industry.
Comput. Oper. Res., 2012

A Column Generation Approach for the Bi-objective Max-min Knapsack Problem.
Proceedings of the ICORES 2012, 2012


  Loading...