Publications

Export 70 results:
Sort by: Author Title Type [ Year (Desc)]
2007
Alagador, D., and J. O. Cerdeira. "Designing spatially-explicit reserve networks in the presence of mandatory sites." Biological Conservation. 137 (2007): 254-262. Abstract
n/a
Barcia, P., M. N. Bugalho, M. L. Campagnolo, and J. O. Cerdeira. "Using n-alkanes to estimate diet composition of herbivores: A novel mathematical approach." Animal. 1 (2007): 141-149. Abstract
n/a
2005
Cerdeira, J. O., K. J. Gaston, and L. S. Pinto. "Connectivity in priority area selection for conservation." Environmental Modeling and Assessment. 10 (2005): 183-192. Abstract
n/a
Barcia, P., and J. O. Cerdeira. "k-colour partitions of acyclic tournaments." Electronic Journal of Combinatorics. 12 (2005): 1-12. Abstract
n/a
Barcia, P., and J. O. Cerdeira. "The k-track assignment problem on partial orders." Journal of Scheduling. 8 (2005): 135-143. Abstract
n/a
Cerdeira, J. O., and L. S. Pinto. "Requiring connectivity in the set covering problem." Journal of Combinatorial Optimization. 9 (2005): 35-47. Abstract
n/a
2004
Cadima, J., J. O. Cerdeira, and M. Minhoto. "Computational aspects of algorithms for variable selection in the context of principal components." Computational Statistics and Data Analysis. 47 (2004): 225-236. Abstract
n/a
2003
Barcia, P., and J. O. Cerdeira. "Node packings on cocomparability graphs." Operations Research Letters. 31 (2003): 341-342. Abstract
n/a
2000
Rodrigues, A. S., J. O. Cerdeira, and K. J. Gaston. "Flexibility, efficiency, and accountability: Adapting reserve selection algorithms to more complex conservation problems." Ecography. 23 (2000): 565-574. Abstract
n/a
1996
Baas, S. M., and J. O. Cerdeira. "Minimum cost K-forest covers." Mathematical Methods of Operations Research. 44 (1996): 255-265. Abstract
n/a
Baas, Sjoerd M., and Jorge Orestes Cerdeira. "Minimum cost K-forest covers." ZOR. Zeitschrift fur Operations-Research. 44 (1996): 255-265. Abstract
n/a
Cerdeira, J. O., R. Cordovil, and T. V. Heitor. "On the characterization of axial maps." Environment and Planning B: Planning and Design. 23 (1996): 771-780. Abstract
n/a
Cerdeira, J. O., and P. Barcia. "Ordered matroids and regular independence systems." Discrete Mathematics. 154 (1996): 255-261. Abstract
n/a
1995
Cerdeira, J. O., I. Faria, and P. Bárcia. "Establishing determinantal inequalities for positive-definite matrices." Discrete Applied Mathematics. 63 (1995): 13-24. Abstract
n/a
Cerdeira, Jorge Orestes. "When is a 0-1 knapsack a matroid ?" Portugaliae Mathematica 52 (1995) 475–480 (1995). Abstract
n/a
1994
Cerdeira, Orestes} {J. "Matroids and a forest cover problem." Mathematical Programming. 66 (1994): 403-405. Abstract

A forest cover of a graph is a spanning forest for which each component has at least two nodes. If K is a subset of nodes, a K-forest cover is a forest cover including exactly one node from K in each component. We show that the weighted two matroid intersection algorithm determines the maximum cost K-forest cover.

Cerdeira, J. O. "Matroids and a forest cover problem." Mathematical Programming. 66 (1994): 403-405. Abstract
n/a
Cerdeira, J.Orestes. "Matroids and a forest cover problem." Mathematical Programming, Series B. 66 (1994): 403-405. Abstract
n/a
1992
Cerdeira, Orestes J. "On the Multi-Depot Vehicle Routing Problem." Operations Research '91. Springer Science $\mathplus$ Business Media, 1992. 144-147. Abstract
n/a
1991
Göbel, F., J. O. Cerdeira, and H. J. Veldman. "Label-connected graphs and the gossip problem." Discrete Mathematics. 87 (1991): 29-40. Abstract
n/a