Jorge Orestes Cerdeira

Temas de interesse: Grafos, Optimização Combinatória, Complexidade Computacional, Biologia da Conservação.

Algumas publicações:

• Linking like with like: optimising connectivity between environmentally-similar habitats (with D Alagador, M Triviño, R Brás, M Cabeza and MB Araújo), to appear in Landscape Ecology.
  
• A combinatorial approach to assess the separability of clusters (with MJ Martins and PC Silva), to appear in Journal of Classification.
  
• The minimum weight t-composition of an integer (with D Cardoso), to appear in Journal of Mathematical Sciences (special issue on Algebraic Techniques in Graph Theory and Optimization).
  
• Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry (with R Figueiredo, A Pereira and C Requejo), International Journal of Mathematical Modelling and Numerical Optimisation 2 (2011) 273-287.
  
• A probability-based approach to match species with reserves when data are at different resolutions (with D Alagador, MJ Martins, M Cabeza and MB Araújo), Biological Conservation 144 (2011) 811-820. 
• Species specific connectivity in reserve-network design using graphs (with LS Pinto, M Cabeza and KJ Gaston), Biological Conservation 143 (2010) 408-415.
• Solving huge size instances of the optimal diversity management problem (with A Agra, D Cardoso, M Miranda and E Rocha), Journal of Mathematical Sciences 161 (2009) 956--960.
  
• Efficient edge domination in regular graphs (with D Cardoso, C Delorme and PC Silva), Discrete Applied Mathematics 156 (2008) 3060–3065.
• Stables isotopes as ecological tracers: an efficient method for assessing the contribution of multiple sources to mixtures (with  MN Bugalho, P Barcia and MC Caldeira), Biogeosciences 5 (2008) 1351–1359.
• Designing spatially-explicit reserve networks in the presence of mandatory sites (with D Alagador), Biological Conservation 137 (2007) 254–262.
• Contextual classification of remote sensing images with integer linear programming (with ML Campagnolo),  in Computational Modelling of Objects Represented in Images: Fundamentals, Methods and Applications, Taylor and Francis, London, 2007, pp 123–128.
• Using N-alkanes to estimate diet composition of herbivores: a novel mathematical approach (with P Barcia, M Bugalho and ML Campagnolo), Animal (Farming Systems and Environment) 1 (2007) 141–149.
• Connectivity in priority area selection for conservation (with KJ Gaston and LS Pinto), Environmental Modeling & Assessment (special issue on Eco-Informatics: Modeling Biological Conservation Decisions) 10 (2005) 183–192.
• The k-track assignment problem on partial orders (with P Barcia), Journal of Scheduling 8 (2005) 135–143.
• Requiring connectivity in the set covering problem (with LS Pinto), Journal of Combinatorial Optimization 9 (2005) 35–47.
• k-Colour partion of acyclic tournaments (with P Barcia), Electronic Journal of Combinatorics 12 (2005) #R5.
• Computational aspects of algorithms for variable selection in the context of principal components (with J Cadima and M Minhoto), Computational Statistics & Data Analysis (special issue on Applications of Optimization Heuristics to Estimation and Modelling Problems) 47 (2004) 225–236.
  
• Node packings on cocomparability graphs (with P Barcia), Operations Research Letters 31 (2003) 341–342.
• A note on mixed graphs and matroids (with R Cordovil), in arXiv.org:math, 2003.
• Flexibility, efficiency, and accountability: adapting reserve selection algorithms to more complex conservation problems (with AS Rodrigues and KJ Gaston), Ecography 23 (2000) 565–574.
  
• On the characterization of axial maps (with R Cordovil and T Heitor), Environment and Planning B: Planning and Design 23 (1996) 771–780.
• Minimum cost k-forest covers (with SM Baas), ZOR-Mathematical Methods of Operations Research 44 (1996) 255–265.
• Ordered matroids and regular independence systems (with P Barcia), Discrete Mathematics 154 (1996) 255–261.
• When is a 0-1 knapsack a matroid ? (with P Barcia), Portugaliae Mathematica 52 (1995) 475–480.
• Establishing determinantal inequalities for positive definite matrices (with I Faria and P Barcia), Discrete Applied Mathematics 63 (1995) 13–24.
• Matroids and a Forest Cover Problem, Mathematical Programming 66 (1994) 403–405.
• The multi-depot traveling salesman problem, Investigação Operacional 12 (1992) 159–167.
  
• Label connected graphs and the gossip problem (with F Gobel and HJ Veldman), Discrete Mathematics 87 (1991) 29–40.

• Umas coisitas de grafos e uma introdução informal à teoria da complexidade computacional (texto expositório).

Produção informática:

• subselect: selecting variable subsets (with J Cadima and M Minhoto). A collection of functions which assess the quality of variable subsets as surrogates for a full data set using three different criteria (Yanais' GCD, Escoufier's RV and McCabe's RM), and search for subsets which are optimal under those criteria, using a simulated annealing algorithm, a genetic algorithm, or a restricted local improvement algorithm), contributed packages of The Comprehensive R Archive Network (CRAN).
• LP_Tracer (with  MN Bugalho, P Barcia and MC Caldeira). Software described in Stables isotopes as ecological tracers: an efficient method for assessing the contribution of multiple sources to mixtures, Biogeosciences, 5, 1351–1359, 2008, for assessing the contribution of multiple sources to mixtures.
  

Mailing address:
Prof. Jorge Orestes Cerdeira
Instituto Superior de Agronomia
Tapada da Ajuda
1349-017 Lisboa, Portugal.
Telephone: +351 21 365 34 67
Fax: +351 21 363 07 23
e-mail: orestes_at_isa.utl.pt