Label-connected graphs and the gossip problem. - F. Göbel; J. Orestes Cerdeira; Henk Jan Veldman (Discret. Math., 1991)

Matroids and a forest cover problem. - J. Orestes Cerdeira (Math. Program., 1994)

Establishing Determinantal Inequalities for Positive-definite Matrices. - J. Orestes Cerdeira; Isabel Faria; Paulo Bárcia (Discret. Appl. Math., 1995)

Ordered matroids and regular independence systems. - J. Orestes Cerdeira; Paulo Bárcia (Discret. Math., 1996)

Minimum costK-forest covers. - Sjoerd M. Baas; J. Orestes Cerdeira (Math. Methods Oper. Res., 1996)

Node packings on cocomparability graphs. - Paulo Bárcia; J. Orestes Cerdeira (Oper. Res. Lett., 2003)

Computational aspects of algorithms for variable selection in the context of principal components. - Jorge Cadima; J. Orestes Cerdeira; Manuel Minhoto (Comput. Stat. Data Anal., 2004)

k-Colour Partitions of Acyclic Tournaments. - Paulo Bárcia; J. Orestes Cerdeira (Electron. J. Comb., 2005)

Requiring Connectivity in the Set Covering Problem. - J. Orestes Cerdeira; Leonor Santiago Pinto (J. Comb. Optim., 2005)

The k-Track Assignment Problem on Partial Orders. - Paulo Bárcia; J. Orestes Cerdeira (J. Sched., 2005)

Contextual classification of remotely sensed images with integer linear programming. - Manuel Lameiras Campagnolo; J. Orestes Cerdeira (CompIMAGE, 2006)

Efficient edge domination in regular graphs. - Domingos Moreira Cardoso; J. Orestes Cerdeira; Charles Delorme; Pedro C. Silva (Discret. Appl. Math., 2008)

Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry. - J. Orestes Cerdeira; Rosa M. V. Figueiredo; António Pereira 002; Cristina Requejo (Int. J. Math. Model. Numer. Optimisation, 2011)

A Combinatorial Approach to Assess the Separability of Clusters. - J. Orestes Cerdeira; Maria João Martins; Pedro C. Silva (J. Classif., 2012)

Linking habitats for multiple species. - Raul Brás; J. Orestes Cerdeira; Diogo Alagador; Miguel B. Araújo (Environ. Model. Softw., 2013)

Using decomposition to improve greedy solutions of the optimal diversity management problem. - Agostinho Agra; Jorge Orestes Cerdeira; Cristina Requejo (Int. Trans. Oper. Res., 2013)

A decomposition approach for the p-median problem on disconnected graphs. - Agostinho Agra; Jorge Orestes Cerdeira; Cristina Requejo (Comput. Oper. Res., 2017)

A computational comparison of compact MILP formulations for the zero forcing number. - Agostinho Agra; Jorge Orestes Cerdeira; Cristina Requejo (Discret. Appl. Math., 2019)

The train frequency compatibility problem. - Jorge Orestes Cerdeira; Carlos Iglésias; Pedro C. Silva (Discret. Appl. Math., 2019)

A centrality notion for graphs based on Tukey depth. - J. Orestes Cerdeira; Pedro C. Silva (Appl. Math. Comput., 2021)

The max-out min-in problem: A tool for data analysis. - Jorge Orestes Cerdeira; Maria João Martins; Marcos Raydan (Comput. Oper. Res., 2023)