![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
José M. F. Craveirinha
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]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
- [j21]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) - [j20]Teresa Gomes
, Lúcia Martins, José M. F. Craveirinha
, Deep Medhi:
Two Algorithms for the k-Widest Path Problem. J. Netw. Syst. Manag. 31(3): 57 (2023)
2010 – 2019
- 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]Teresa Gomes
, Miguel Soares, José M. F. Craveirinha
, Paulo E. Melo
, Luísa Jorge
, Vitor Mirones, André Brízido:
Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost. J. Netw. Syst. Manag. 23(4): 1067-1103 (2015) - 2013
- [j17]Jorge Sá Esteves
, José M. F. Craveirinha
:
On a bicriterion server allocation problem in a multidimensional Erlang loss system. J. Comput. Appl. Math. 252: 103-119 (2013) - [j16]José M. F. Craveirinha
, João C. N. Clímaco
, Lúcia Martins
, Carlos Gomes da Silva
, Nuno Ferreira:
A bi-criteria minimum spanning tree routing model for MPLS/overlay networks. Telecommun. Syst. 52(1): 203-215 (2013) - [c11]Lúcia Martins
, Joao Lopes, José M. F. Craveirinha
, João C. N. Clímaco, Ricardo Cadime, Catarina Monica:
Network performance improvement through evaluation of bicriteria routing methods in transport networks. CNSM 2013: 34-41 - 2012
- [c10]Teresa Gomes
, Lúcia Martins
, José Silva, Nuno Gomes Ferreira, José M. F. Craveirinha
, João C. N. Clímaco
, Ricardo Cadime, Catarina Monica:
Protected bicriteria paths in transport networks. ICUMT 2012: 731-737 - 2011
- [j15]João C. N. Clímaco
, José M. F. Craveirinha
:
On OR-based routing approaches for the Internet. Int. Trans. Oper. Res. 18(3): 295-305 (2011) - [c9]Lúcia Martins, Nuno Ferreira, José M. F. Craveirinha:
A bi-criteria algorithm for multipoint-to-multipoint virtual connections in transport networks. CNSM 2011: 1-5 - [c8]Teresa Gomes
, José Silva, José M. F. Craveirinha
, Carlos Simões:
SRLG failure-disjoint path pair of min-sum cost in GMPLS networks. DRCN 2011: 196-203 - [c7]Teresa Gomes, José Silva, José M. F. Craveirinha, Carlos Simões:
Failure protected shortest paths in GMPLS networks. ICUMT 2011: 1-7 - [c6]José Silva, Teresa Gomes, Luis Fernandes, Carlos Simões, José M. F. Craveirinha:
An heuristic for maximally SRLG-disjoint path pairs calculation. ICUMT 2011: 1-8 - 2010
- [j14]João C. N. Clímaco, José M. F. Craveirinha
:
On the role of operations research practice in strategic environmental impact assessment. Int. Trans. Oper. Res. 17(4): 445-456 (2010) - [j13]Teresa Gomes
, José M. F. Craveirinha
, Luísa Jorge
:
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs. J. Comb. Optim. 19(3): 394-414 (2010)
2000 – 2009
- 2009
- [j12]Teresa Gomes
, José M. F. Craveirinha
, Luísa Jorge
:
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs. Comput. Oper. Res. 36(5): 1670-1682 (2009) - [j11]Rita Girão-Silva
, José M. F. Craveirinha
, João C. N. Clímaco:
Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution. Int. Trans. Oper. Res. 16(3): 275-305 (2009) - [j10]Teresa Gomes
, José M. F. Craveirinha
, João C. N. Clímaco
, Carlos Simões:
A bicriteria routing model for multi-fibre WDM networks. Photonic Netw. Commun. 18(3): 287-299 (2009) - [c5]Lúcia Martins
, Catarina Francisco, João Redol, José M. F. Craveirinha
, João C. N. Clímaco
, Paulo P. Monteiro
:
Evaluation of a Multiobjective Alternative Routing Method in Carrier IP/MPLS Networks. Networking 2009: 195-206 - 2008
- [j9]José M. F. Craveirinha
, Rita Girão-Silva
, João C. N. Clímaco
:
A meta-model for multiobjective routing in MPLS networks. Central Eur. J. Oper. Res. 16(1): 79-105 (2008) - 2007
- [j8]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) - [j7]Teresa Gomes
, José M. F. Craveirinha
:
Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks. Eur. J. Oper. Res. 181(3): 1055-1064 (2007) - [c4]José M. F. Craveirinha
, Rita Girão-Silva
, João C. N. Clímaco
, Lúcia Martins
:
A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes. System Modelling and Optimization 2007: 196-219 - 2006
- [j6]Lúcia Martins
, José M. F. Craveirinha
, João C. N. Clímaco
:
A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance. Comput. Manag. Sci. 3(3): 225-244 (2006) - 2005
- [j5]Lúcia Martins
, José M. F. Craveirinha
, João C. N. Clímaco
, Teresa Gomes
:
On a bi-dimensional dynamic alternative routing method. Eur. J. Oper. Res. 166(3): 828-842 (2005) - 2004
- [c3]Luísa Jorge
, José M. F. Craveirinha
, Teresa Gomes
:
Network Performance of Multi-Service Circuit Switched Networks: Simulational Comparison of Variants of DAR and RTNR. MASCOTS 2004: 513-521 - 2003
- [j4]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) - [c2]Rita Girão-Silva
, José M. F. Craveirinha
:
A Comparative Study on Simulation Models for Self-similar Traffic. HSNMC 2003: 571-580 - 2002
- [j3]Teresa Gomes
, José M. F. Craveirinha
, Lúcia Martins
:
An efficient algorithm for sequential generation of failure states in a network with multi-mode components. Reliab. Eng. Syst. Saf. 77(2): 111-119 (2002) - 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
- 1998
- [j2]Carlos Henggeler Antunes
, José M. F. Craveirinha
, João C. N. Clímaco:
Planning the evolution to broadband access networks: A multicriteria approach. Eur. J. Oper. Res. 109(2): 530-540 (1998) - 1992
- [j1]José M. F. Craveirinha
, João C. N. Clímaco:
A survey of applications of mathematical programming to circuit-switched network planning problems. Eur. Trans. Telecommun. 3(5): 499-515 (1992)
Coauthor Index
aka: Lúcia M. R. A. Martins
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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 20:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint