default search action
Telmo Pinto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j5]Mário Leite
, Telmo Pinto
Solving the integrated planning and scheduling problem using variable neighborhood search based algorithms. Expert Syst. Appl. 228: 120191 (2023) - [c9]Rita Martins
An Exact Optimization Approach for Personnel Scheduling Problems in the Call Center Industry. ICCSA (Workshops 2) 2023: 407-424 - [c8]Manuel Eusébio
The Consistent Vehicle Routing Problem: An Application to the Pharmaceutical Supply Chain. OL2A (1) 2023: 424-437 - [c7]Mário Jorge Simões
Optimization of the Energy Consumption for Robotic Kitting in the Automotive Industry. ROBOT (1) 2023: 483-494 - 2021
- [c6]Catarina Pena, Telmo Pinto
A Two-Stage Heuristic for a Real Multi-compartment and Multi-trip Vehicle Routing Problem with Time Windows. ICCSA (5) 2021: 274-289 - 2020
- [j4]Telmo Pinto
Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls. Int. Trans. Oper. Res. 27(1): 549-572 (2020)
2010 – 2019
- 2018
- [j3]Telmo Pinto
Column generation based primal heuristics for routing and loading problems. Electron. Notes Discret. Math. 64: 135-144 (2018) - 2017
- [j2]Telmo Pinto
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints. Electron. Notes Discret. Math. 58: 111-118 (2017) - [c5]Mário Leite
Variable Neighborhood Search for Integrated Planning and Scheduling. ICCSA (2) 2017: 709-724 - 2016
- [c4]Telmo Pinto
A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints. ICCL 2016: 321-336 - 2015
- [c3]Telmo Pinto
Variable Neighborhood Search for the Elementary Shortest Path Problem with Loading Constraints. ICCSA (2) 2015: 474-489 - 2012
- [j1]Cláudio Alves
New constructive algorithms for leather nesting in the automotive industry. Comput. Oper. Res. 39(7): 1487-1505 (2012) - [c2]Cláudio Alves, Raïd Mansi, Telmo Pinto, José M. Valério de Carvalho:
A Column Generation Approach for the Bi-objective Max-min Knapsack Problem. ICORES 2012: 165-170 - 2011
- [c1]Telmo Pinto, Ana Rebelo
Music Score Binarization Based on Domain Knowledge. IbPRIA 2011: 700-708
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 00:13 CEST 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: