default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarta M. B. Pascoal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]José M. F. Craveirinha, João C. N. Clímaco, Rita Girão-Silva, Marta Pascoal:
Multiobjective Path Problems and Algorithms in Telecommunication Network Design - Overview and Trends. Algorithms 17(6): 222 (2024)- 2023
- [j26]José M. F. Craveirinha
, Marta Pascoal, João C. N. Clímaco:
An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks. INFOR Inf. Syst. Oper. Res. 61(3): 399-418 (2023) - [c5]Sónia Rafael, Francisco Rebelo, Beatriz Pinto, Andreia Gil, Catharina Lima, Joana Chitas, Marta Pascoal, Lúcio Simões:
Inclusion Through Accessibility. Handi Bot, a Translator for Portuguese Sign Language. HCI (10) 2023: 451-466 - 2022
- [j25]Ali Moghanni, Marta Pascoal, Maria Teresa Godinho:
Finding K dissimilar paths: Single-commodity and discretized flow formulations. Comput. Oper. Res. 147: 105939 (2022) - [j24]Ali Moghanni, Marta Pascoal, Maria Teresa Godinho:
Finding shortest and dissimilar paths. Int. Trans. Oper. Res. 29(3): 1573-1601 (2022) - [c4]Antonio Cassia, Ola Jabali, Federico Malucelli, Marta Pascoal:
The electric vehicle shortest path problem with time windows and prize collection. FedCSIS 2022: 313-322 - 2020
- [j23]Marta M. B. Pascoal, João C. N. Clímaco:
On a relaxed maximally disjoint path pair problem: a bicriteria approach. Int. Trans. Oper. Res. 27(4): 2045-2063 (2020)
2010 – 2019
- 2017
- [j22]Teresa Gomes, Lúcia Martins, Sofia Ferreira, Marta Pascoal, David Tipper:
Algorithms for determining a node-disjoint path pair visiting specified nodes. Opt. Switch. Netw. 23: 189-204 (2017) - 2016
- [j21]Marta M. B. Pascoal, Marisa Resende:
Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios. Discret. Optim. 22: 122-140 (2016) - [j20]João C. N. Clímaco, Marta M. B. Pascoal:
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs. INFOR Inf. Syst. Oper. Res. 54(4): 317-343 (2016) - [j19]José M. F. Craveirinha, João C. N. Clímaco, Lúcia M. R. A. Martins, Marta M. B. Pascoal:
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks. Telecommun. Syst. 62(2): 327-346 (2016) - 2015
- [j18]Gilbert Laporte, Marta M. B. Pascoal:
Path based algorithms for metro network design. Comput. Oper. Res. 62: 78-94 (2015) - [c3]Teresa Gomes, Sofia Marques, Lúcia Martins, Marta Pascoal, David Tipper:
Protected shortest path visiting specified nodes. RNDM@WMNC 2015: 120-127 - 2014
- [j17]Marta M. B. Pascoal, Marisa Resende:
The minmax regret robust shortest path problem in a finite multi-scenario model. Appl. Math. Comput. 241: 88-111 (2014) - 2013
- [j16]Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco, Ana Laranjeira:
Bicriteria path problem minimizing the cost and minimizing the number of labels. 4OR 11(3): 275-294 (2013) - 2012
- [j15]Claudio T. Bornstein, Nelson Maculan, Marta Pascoal, Leizer de Lima Pinto:
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization. Comput. Oper. Res. 39(9): 1969-1976 (2012) - [j14]Marta M. B. Pascoal, Antonio Sedeño-Noda:
Enumerating K best paths in length order in DAGs. Eur. J. Oper. Res. 221(2): 308-316 (2012) - [j13]João C. N. Clímaco, Marta M. B. Pascoal:
Multicriteria path and tree problems: discussion on exact algorithms and applications. Int. Trans. Oper. Res. 19(1-2): 63-98 (2012) - 2011
- [j12]Gilbert Laporte, Marta M. B. Pascoal:
Minimum cost path problems with relays. Comput. Oper. Res. 38(1): 165-173 (2011) - 2010
- [j11]Leizer de Lima Pinto, Marta M. B. Pascoal:
On algorithms for the tricriteria shortest path problem with two bottleneck objective functions. Comput. Oper. Res. 37(10): 1774-1779 (2010) - [j10]João C. N. Clímaco, M. Eugénia V. Captivo, Marta M. B. Pascoal:
On the bicriterion - minimal cost/minimal label - spanning tree problem. Eur. J. Oper. Res. 204(2): 199-205 (2010)
2000 – 2009
- 2009
- [j9]João C. N. Clímaco, Marta M. B. Pascoal:
Finding non-dominated bicriteria shortest pairs of disjoint simple paths. Comput. Oper. Res. 36(11): 2892-2898 (2009) - [j8]M. Eugénia V. Captivo, João C. N. Clímaco, Marta M. B. Pascoal:
A mixed integer linear formulation for the minimum label spanning tree problem. Comput. Oper. Res. 36(11): 3082-3085 (2009) - [c2]Ana Maria de Almeida, João Fernandes, Marta Pascoal, Susana Pereira:
Experiential Learning in Science: Getting the Laboratory Inside the Classroom Using the Web. ICALT 2009: 327-328 - 2007
- [j7]João C. N. Clímaco, Marta M. B. Pascoal, José M. F. Craveirinha, M. Eugénia V. Captivo:
Internet packet routing: Application of a K. Eur. J. Oper. Res. 181(3): 1045-1054 (2007) - 2006
- [j6]Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco:
A comprehensive survey on the quickest path problem. Ann. Oper. Res. 147(1): 5-21 (2006) - 2005
- [j5]Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco:
An algorithm for ranking quickest simple paths. Comput. Oper. Res. 32: 509-520 (2005) - 2003
- [j4]Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal:
A new implementation of Yen's ranking loopless paths algorithm. 4OR 1(2): 121-133 (2003) - [j3]Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco:
A note on a new variant of Murty's ranking assignments algorithm. 4OR 1(3): 243-255 (2003) - [j2]João C. N. Clímaco, José M. F. Craveirinha, Marta M. B. Pascoal:
A bicriterion approach for routing problems in multimedia networks. Networks 41(4): 206-220 (2003) - 2001
- [c1]Teresa Gomes, José M. F. Craveirinha, Lúcia Martins, Marta Pascoal:
An Algorithm for Calculating the k Most Reliable Link Disjoint Paths with a Maximum Number of Arcs in Each Path. DRCN 2001: 205-212
1990 – 1999
- 1999
- [j1]Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal, José Luis E. Dos Santos:
Deviation Algorithms for Ranking Shortest Paths. Int. J. Found. Comput. Sci. 10(3): 247-262 (1999)
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-07-24 21:39 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:
