J. Orestes Cerdeira
According to our database1, J. Orestes Cerdeira
Legend:Book In proceedings Article PhD thesis Other
A decomposition approach for the p-median problem on disconnected graphs.
Computers & OR, 2017
Using decomposition to improve greedy solutions of the optimal diversity management problem.
Linking habitats for multiple species.
Environmental Modelling and Software, 2013
A Combinatorial Approach to Assess the Separability of Clusters.
J. Classification, 2012
Scheduling with sequence-dependent batch setup times: planning tests for a pharmaceutic industry.
Efficient edge domination in regular graphs.
Discrete Applied Mathematics, 2008
Contextual classification of remotely sensed images with integer linear programming.
Proceedings of the Computational Modeling of Objects Represented in Images-Fundamentals, 2006
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
Computational aspects of algorithms for variable selection in the context of principal components.
Computational Statistics & Data Analysis, 2004
Node packings on cocomparability graphs.
Oper. Res. Lett., 2003
Minimum costK-forest covers.
Math. Meth. of OR, 1996
Ordered matroids and regular independence systems.
Discrete Mathematics, 1996
Establishing Determinantal Inequalities for Positive-definite Matrices.
Discrete Applied Mathematics, 1995
Matroids and a forest cover problem.
Math. Program., 1994
Label-connected graphs and the gossip problem.
Discrete Mathematics, 1991