# J. Orestes Cerdeira

According to our database

Collaborative distances:

^{1}, J. Orestes Cerdeira authored at least 17 papers between 1991 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

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

Computers & OR, 2017

2013

Using decomposition to improve greedy solutions of the optimal diversity management problem.

ITOR, 2013

Linking habitats for multiple species.

Environmental Modelling and Software, 2013

2012

A Combinatorial Approach to Assess the Separability of Clusters.

J. Classification, 2012

2011

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

IJMNO, 2011

2008

Efficient edge domination in regular graphs.

Discrete Applied Mathematics, 2008

2006

Contextual classification of remotely sensed images with integer linear programming.

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

2005

The

*k*-Track Assignment Problem on Partial Orders.
J. Scheduling, 2005

Requiring Connectivity in the Set Covering Problem.

J. Comb. Optim., 2005

k-Colour Partitions of Acyclic Tournaments.

Electr. J. Comb., 2005

2004

Computational aspects of algorithms for variable selection in the context of principal components.

Computational Statistics & Data Analysis, 2004

2003

Node packings on cocomparability graphs.

Oper. Res. Lett., 2003

1996

Minimum cost

*K*-forest covers.
Math. Meth. of OR, 1996

Ordered matroids and regular independence systems.

Discrete Mathematics, 1996

1995

Establishing Determinantal Inequalities for Positive-definite Matrices.

Discrete Applied Mathematics, 1995

1994

Matroids and a forest cover problem.

Math. Program., 1994

1991

Label-connected graphs and the gossip problem.

Discrete Mathematics, 1991