Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé Brandão 0001
Person information
- affiliation: University of Minho, Braga, Portugal
- affiliation (PhD 1994): Lancaster University, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1994
[b1]José Carlos Soares Brandão:
A decision support system and algorithms for the vehicle routing and scheduling problem. Lancaster University, UK, 1994
Journal Articles
- 2020
- [j10]José Brandão
:
A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. Eur. J. Oper. Res. 284(2): 559-571 (2020) - 2018
- [j9]José Brandão:
Iterated local search algorithm with ejection chains for the open vehicle routing problem with time windows. Comput. Ind. Eng. 120: 146-159 (2018) - 2011
- [j8]José Brandão:
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Comput. Oper. Res. 38(1): 140-151 (2011) - 2009
- [j7]José Brandão:
A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. 195(3): 716-728 (2009) - 2008
- [j6]José Brandão, Richard W. Eglese:
A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper. Res. 35(4): 1112-1126 (2008) - 2006
- [j5]José Brandão:
A new tabu search algorithm for the vehicle routing problem with backhauls. Eur. J. Oper. Res. 173(2): 540-555 (2006) - 2005
- [j4]José António Crispim, José Brandão:
Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. J. Oper. Res. Soc. 56(11): 1296-1302 (2005) - 2004
- [j3]José Brandão:
A tabu search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 157(3): 552-564 (2004) - 1998
- [j2]José Carlos Soares Brandão, Alan Mercer:
The multi-trip vehicle routing problem. J. Oper. Res. Soc. 49(8): 799-805 (1998) - 1997
- [j1]José Brandão, Alan Mercer:
A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur. J. Oper. Res. 100(1): 180-191 (1997)
Conference and Workshop Papers
- 2018
- [c3]Deepthi Devaki Akkoorath, José Brandão, Annette Bieniusa, Carlos Baquero:
Global-Local View: Scalable Consistency for Concurrent Data Types. Euro-Par 2018: 492-504 - 2017
- [c2]Deepthi Devaki Akkoorath, José Brandão, Annette Bieniusa, Carlos Baquero:
Multi-view data types for scalable concurrency in the multi-core era. PMLDC@ECOOP 2017: 3:1 - [c1]José Brandão:
Metaheuristic for the Vehicle Routing Problem with Backhauls and Time Windows. OR 2017: 413-418
Informal and Other Publications
- 2017
- [i1]Deepthi Devaki Akkoorath, José Brandão, Annette Bieniusa, Carlos Baquero:
Global-Local View: Scalable Consistency for Concurrent Data Types. CoRR abs/1705.03704 (2017)
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-04-26 20:15 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:
