José M. F. Craveirinha
Orcid: 0000-0001-8562-3730
According to our database1,
José M. F. Craveirinha
authored at least 32 papers
between 1992 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks.
INFOR Inf. Syst. Oper. Res., August, 2023
2016
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks.
Telecommun. Syst., 2016
2015
Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum Cost.
J. Netw. Syst. Manag., 2015
2013
Telecommun. Syst., 2013
J. Comput. Appl. Math., 2013
Network performance improvement through evaluation of bicriteria routing methods in transport networks.
Proceedings of the 9th International Conference on Network and Service Management, 2013
2012
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012
2011
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011
Proceedings of the 8th International Workshop on the Design of Reliable Communication Networks, 2011
A bi-criteria algorithm for multipoint-to-multipoint virtual connections in transport networks.
Proceedings of the 7th International Conference on Network and Service Management, 2011
2010
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs.
J. Comb. Optim., 2010
On the role of operations research practice in strategic environmental impact assessment.
Int. Trans. Oper. Res., 2010
2009
Photonic Netw. Commun., 2009
Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution.
Int. Trans. Oper. Res., 2009
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs.
Comput. Oper. Res., 2009
Evaluation of a Multiobjective Alternative Routing Method in Carrier IP/MPLS Networks.
Proceedings of the NETWORKING 2009, 2009
2008
Central Eur. J. Oper. Res., 2008
2007
Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks.
Eur. J. Oper. Res., 2007
A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes.
Proceedings of the System Modeling and Optimization, 2007
2006
A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance.
Comput. Manag. Sci., 2006
2005
2004
Network Performance of Multi-Service Circuit Switched Networks: Simulational Comparison of Variants of DAR and RTNR.
Proceedings of the 12th International Workshop on Modeling, 2004
2003
Proceedings of the High Speed Networks and Multimedia Communications, 2003
2002
An efficient algorithm for sequential generation of failure states in a network with multi-mode components.
Reliab. Eng. Syst. Saf., 2002
2001
An Algorithm for Calculating the k Most Reliable Link Disjoint Paths with a Maximum Number of Arcs in Each Path.
Proceedings of the 3rd International Workshop on the Design of Reliable Communication Networks, 2001
1998
Eur. J. Oper. Res., 1998
1992
A survey of applications of mathematical programming to circuit-switched network planning problems.
Eur. Trans. Telecommun., 1992