The following pages link to Jorge Orestes Cerdeira (Q1652379):
Displaying 7 items.
- Computational aspects of algorithms for variable selection in the context of principal components (Q82630) (← 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)
- A decomposition approach for the \(p\)-median problem on disconnected graphs (Q1652380) (← links)
- Requiring connectivity in the set covering problem (Q1774524) (← links)
- Using decomposition to improve greedy solutions of the optimal diversity management problem (Q2862154) (← links)
