J. Orestes Cerdeira

According to our database, J. Orestes Cerdeira authored at least 21 papers between 1991 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

The max-out min-in problem: A tool for data analysis.

Jorge Orestes Cerdeira, Maria João Martins, Marcos Raydan

Comput. Oper. Res., June, 2023

2021

A centrality notion for graphs based on Tukey depth.

J. Orestes Cerdeira, Pedro C. Silva

Appl. Math. Comput., 2021

2019

The train frequency compatibility problem.

Jorge Orestes Cerdeira, Carlos Iglésias, Pedro C. Silva

Discret. Appl. Math., 2019

A computational comparison of compact MILP formulations for the zero forcing number.

Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo

Discret. Appl. Math., 2019

2017

A decomposition approach for the p-median problem on disconnected graphs.

Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo

Comput. Oper. Res., 2017

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

Linking habitats for multiple species.

Raul Brás, J. Orestes Cerdeira, Diogo Alagador, Miguel B. Araújo

Environ. Model. Softw., 2013

2012

A Combinatorial Approach to Assess the Separability of Clusters.

J. Orestes Cerdeira, Maria João Martins, Pedro C. Silva

J. Classif., 2012

2011

Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry.

J. Orestes Cerdeira, Rosa M. V. Figueiredo, António Pereira, Cristina Requejo

Int. J. Math. Model. Numer. Optimisation, 2011

2008

Efficient edge domination in regular graphs.

Domingos Moreira Cardoso, J. Orestes Cerdeira, Charles Delorme, Pedro C. Silva

Discret. Appl. Math., 2008

2006

Contextual classification of remotely sensed images with integer linear programming.

Manuel Lameiras Campagnolo, J. Orestes Cerdeira

Proceedings of the Computational Modeling of Objects Represented in Images-Fundamentals, 2006

2005

The <i>k</i>-Track Assignment Problem on Partial Orders.

Paulo Bárcia, J. Orestes Cerdeira

J. Sched., 2005

Requiring Connectivity in the Set Covering Problem.

J. Orestes Cerdeira, Leonor Santiago Pinto

J. Comb. Optim., 2005

k-Colour Partitions of Acyclic Tournaments.

Paulo Bárcia, J. Orestes Cerdeira

Electron. J. Comb., 2005

2004

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

2003

Node packings on cocomparability graphs.

Paulo Bárcia, J. Orestes Cerdeira

Oper. Res. Lett., 2003

1996

Minimum cost<i>K</i>-forest covers.

Sjoerd M. Baas, J. Orestes Cerdeira

Math. Methods Oper. Res., 1996

Ordered matroids and regular independence systems.

J. Orestes Cerdeira, Paulo Bárcia

Discret. Math., 1996

1995

Establishing Determinantal Inequalities for Positive-definite Matrices.

J. Orestes Cerdeira, Isabel Faria, Paulo Bárcia

Discret. Appl. Math., 1995

1994

Matroids and a forest cover problem.

J. Orestes Cerdeira

Math. Program., 1994

1991

Label-connected graphs and the gossip problem.

F. Göbel, J. Orestes Cerdeira, Henk Jan Veldman

Discret. Math., 1991