|
Work
Publications
Monographs
Published Papers
Submitted Papers
Research Reports
Communications
Editorial Activity
Meetings
Papers at Google Scholar
|
Work
Network Optimization / Operations Research:
Publications
Monographs
Published Papers
2012
The
pipeline and valve location problem,
G. Laporte and M. Pascoal,
European Journal of Industrial Engineering, 6(3):301-321, 2012
2011
2010
2009
2007
Traffic
splitting in MPLS networks - a hierarchical multicriteria
approach,
J.
Clímaco, J. Craveirinha, M. Pascoal and L. Martins,
Journal of Telecommunications and Information Technology, 4:3-10, 2007
2006
2005
Ranking
optimal paths,
M.
Pascoal, M. E. Captivo and J. Clímaco,
Proceedings
of the International Network Optimization Conference INOC 2005,
Lisboa, Portugal, B2.615-B2.621, March 2005
2004-1999
Internet
packet routing: application of a K-quickest path algorithm,
J.
Clímaco, M. Pascoal, J. Craveirinha and M. E. Captivo,
Proceedings
of the III International Conference on Decision Support for
Telecommunications and Information Society DSTIS'03,
Warsaw, Poland, 29-36, September 2003
An
algorithm for calculating the K most reliable link disjoint paths
with a maximum number of arcs,
T. Gomes,
J. Craveirinha, E. Martins, L. Martins and M. Pascoal,
Proceedings
of the 3rd International Workshop on Design of Reliable
Communication Networks DRCN 2001,
Budapest University of Technology and Economics, Hungary, 205-212,
2001
An
algorithm for calculating the K most reliable disjoint paths with
a maximum number of arcs,
T. Gomes,
J. Craveirinha, E. Martins, L. Martins and M. Pascoal,
Proceedings
of the European Conference on Safety and Reliability ESREL'2001,
Politectnico di Torino, Italy, 3:1659-1666, 2001
Submitted Papers
Combining multi-criteria analysis and tabu search to solve real-life
dial-a-ride problems,
J. Paquette, J.-F. Cordeau, G. Laporte and M. Pascoal, July 2011
Bicriteria
path problem minimizing the cost and minimizing the number of labels,
M. E. Captivo, J. Clímaco, A. Laranjeira and M. Pascoal, January 2011
Research Reports
An
algorithm for calculating the K most reliable disjoint paths with
a maximum number of arcs,
T. Gomes,
J. Craveirinha, E. Martins, L. Martins and M. Pascoal, Technical
Report ET-N9, INESC-Coimbra, 2001
Communications
Combinatorial optimization problems with a cost and several bottleneck objectives: Algorithm and reoptimization,
M. Pascoal, C. Bornstein, N. Maculan and L. Pinto,
Optimization 2011, Caparica, Portugal, July 2011
Comparing the bicriteria path and tree problems involving cost versus number of labels minimization,
J. Clímaco, M. E. Captivo and M. Pascoal,
IFORS 2011, Melbourne, Australia, July 2011
Finding paths with minimal cost and minimal number of labels,
M. Pascoal, M. E. Captivo, J. Clímaco and A. Laranjeira,
NOW 2010, Ajaccio, France, August 2010
The pipeline and
valve location problem,
M. Pascoal and G. Laporte,
EURO 2010, Lisbon, Portugal, July 2010
Minimum cost
path problems with relays,
M. Pascoal and G. Laporte,
ALIO/INFORMS 2010, Buenos Aires, Argentina, June 2010
New labeling
algorithms for minimum-hop bicriteria path problems,
M. Pascoal,
EURO 2009, Bonn, Germany, July 2009
On the bicriterion -
minimum cost/minimum label - spanning tree problem,
J. Clímaco, M. E. Captivo and M.
Pascoal,
EURO 2009, Bonn, Germany, July 2009
A mixed
integer linear formulation for the minimum label spanning tree
problem,
M. E. Captivo, J. Clímaco and M.
Pascoal,
EURO 2009, Bonn, Germany, July 2009
Multicriteria
approaches for a
routing problem in multimedia networks,
M.
Pascoal,
Centre
Interuniversitaire de Recherche sur les Réseaux
d'Entreprise, la Logistique et le Transport, University of
Montréal, November 2008
Do
caminho mais curto ao caminho mais curto por unidade de tempo,
M.
Pascoal,
Encontro
da SPM 2008, Coimbra, June 2008
Árvores,
caminhos e cores,
M.
Pascoal, M. E. Captivo and J. Clímaco,
IO'2008,
Vila Real, March 2008
Finding
non-dominated shortest pairs of disjoint simple paths,
M.
Pascoal and J. Clímaco,
Optimization
2007, Porto, July 2007
A
hybrid deviation algorithm for ranking K shortest simple paths,
M.
Pascoal,
EURO
2007, Prague, Czech Republic, July 2007
An
algorithm for a bicriterion - minimum cost / minimum label -
spanning tree problem,
M.
Pascoal, M. E. Captivo e J. Clímaco,
Iberian
Conference in Optimization, Coimbra, November 2006
Implementations
and empirical comparison for K shortest loopless path algorithms,
M.
Pascoal,
The Ninth
DIMACS Implementation Challenge: The Shortest Path Problem,
Piscataway, NJ, United States of America, November 2006
An
algorithm for a bicriterion - minimum cost/minimum label -
spanning tree problem,
M.
Pascoal, M. E. Captivo e J. Clímaco,
EURO
2006, Reykjavík, Iceland, July 2006
A
hierarchical multicriteria routing model in multimedia networks,
J.
Clímaco, J. Craveirinha e M. Pascoal,
EURO
2006, Reykjavík, Iceland, July 2006
A
lazy version of a K quickest simple path ranking algorithm,
M.
Pascoal, M. E. Captivo e J. Clímaco,
ALIO/EURO
2005, Paris, France, October 2005
Uma
metodologia automática do tipo ponto de referência
para problemas do trajecto mais curto multicritério,
M.
Pascoal, J. Clímaco and J. Craveirinha,
AIORT
2005, Coimbra, September 2005
An
automatic reference point-like methodology for multicriteria
shortest path problems based on a bicriteria model,
J.
Clímaco, J. Craveirinha and M. Pascoal,
CSM/KSS'2005,
Laxenburg, Austria, August 2005
Ranking
optimal paths,
M.
Pascoal, M. E. Captivo and J. Clímaco,
INOC
2005, Lisboa, March 2005
Routing
calculation in multimedia: A procedure based on a bicriteria
model,
J.
Clímaco, J. Craveirinha and M. Pascoal,
MMTN
2004, Coimbra, September 2004
Quickest
path algorithms and an application to Internet packet routing,
M.
Pascoal, M. E. Captivo, J. Clímaco and J. Craveirinha,
AIRO
2004, Lecce, Italy, September 2004
An
algorithm for ranking quickest simple paths,
J.
Clímaco, M. Pascoal and M. E. Captivo,
Optimization
2004, Lisboa, July 2004
Routing
calculation in multimedia: A procedure based on a bicriteria
model,
J.
Clímaco, J. Craveirinha, M. Pascoal,
ECCOMAS
2004, Jyväskylä, Finland, July 2004
Aplicação
de um algoritmo para os K caminhos mais rápidos ao
encaminhamento de dados na Internet,
M.
Pascoal, J. Clímaco, J. Craveirinha and M. E. Captivo,
IO'2004,
Porto, March 2004
Um
algoritmo para as K afectações de menor custo,
M.
Pascoal, M. E. Captivo and J. Clímaco,
IO'2002,
Guimarães, March 2002
An
algorithm for calculating the K most reliable link disjoint paths
with a maximum number of arcs,
T. Gomes,
J. Craveirinha, E. Martins, L. Martins and M. Pascoal,
3rd
International Workshop on Design of Reliable Communication
Networks DRCN 2001, Hungary, 2001
An
algorithm for calculating the K most reliable disjoint paths with
a maximum number of arcs,
T. Gomes,
J. Craveirinha, E. Martins, L. Martins and M. Pascoal,
European
Conference on Safety and Reliability ESREL'2001, Italy, September
2001
Editorial activity
Meetings
|