default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPedro Moura 0002
Person information
- affiliation: University of Lisboa, Faculty of Science, Portugal
Other persons with the same name
- Pedro Moura — disambiguation page
- Pedro Moura 0001
![[0000-0003-4852-2812]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-4852-2812")
(aka: Pedro S. Moura) — University of Coimbra, Institute of System and Robotics, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j8]Bernard Fortz, Luis Gouveia, Pedro Moura:
A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. Networks 80(2): 178-192 (2022)
2010 – 2019
- 2018
- [j7]Luís Gouveia, Pedro Moura:
Preface. Electron. Notes Discret. Math. 64: 1-3 (2018) - [j6]Luis Gouveia, Pedro Moura:
New advances and applications in deterministic and stochastic network optimization. Networks 72(1): 3-4 (2018) - 2014
- [j5]Luis Eduardo Neves Gouveia, Pedro Moura, Mario Ruthmair, Amaro de Sousa:
Spanning trees with variable degree bounds. Eur. J. Oper. Res. 239(3): 830-841 (2014) - 2012
- [j4]Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza:
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs. Networks 60(1): 1-18 (2012) - 2011
- [j3]Luis Eduardo Neves Gouveia, Pedro Moura, Amaro de Sousa:
Prize collecting Steiner trees with node degree dependent costs. Comput. Oper. Res. 38(1): 234-245 (2011) - [c1]Luis Eduardo Neves Gouveia, Pedro Moura, Amaro de Sousa:
Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks. INOC 2011: 77-82 - 2010
- [j2]Luis Eduardo Neves Gouveia, Pedro Moura:
Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. Electron. Notes Discret. Math. 36: 985-992 (2010)
2000 – 2009
- 2008
- [j1]Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza:
Models and heuristics for a minimum arborescence problem. Networks 51(1): 34-47 (2008)
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-10-07 22:17 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:
