The following pages link to Jorge Orestes Cerdeira (Q1652379):
Displaying 26 items.
- subselect (Q18855) (← links)
- Computational aspects of algorithms for variable selection in the context of principal components (Q82630) (← links)
- (Q263325) (redirect page) (← links)
- A combinatorial approach to assess the separability of clusters (Q263327) (← links)
- The minimum weight \(t\)-composition of an integer (Q690540) (← links)
- Efficient edge domination in regular graphs (Q1005253) (← links)
- Matroids and a forest cover problem (Q1337143) (← links)
- Node packings on cocomparability graphs (Q1400341) (← links)
- A decomposition approach for the \(p\)-median problem on disconnected graphs (Q1652380) (← links)
- \(k\)-colour partitions of acyclic tournaments (Q1773195) (← links)
- Requiring connectivity in the set covering problem (Q1774524) (← links)
- Establishing determinantal inequalities for positive-definite matrices (Q1902888) (← links)
- Ordered matroids and regular independence systems (Q1918556) (← links)
- A centrality notion for graphs based on Tukey depth (Q2244178) (← links)
- The train frequency compatibility problem (Q2328084) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- The \(k\)-Track assignment problem on partial orders (Q2464438) (← links)
- Using decomposition to improve greedy solutions of the optimal diversity management problem (Q2862154) (← links)
- (Q3693289) (← links)
- (Q3811703) (← links)
- (Q3823415) (← links)
- (Q4011584) (← links)
- (Q4716340) (← links)
- (Q4866688) (← links)
- Injective edge coloring of graphs (Q5864435) (← links)
- The max-out min-in problem: a tool for data analysis (Q6164596) (← links)
