Subset Selection Problem (high level)
$50-150 USD
Dibayar saat pengiriman
I have a matrix with dimension 64*25, I want to find the best 8 rows and 8 columns that maximize an objective function. I am looking for low complexity, fast, and efficient algorithm. I have already done some algorithms, but the results is not as I expected. Please, do not waste my time if you do not have any idea about the problem.
ID Proyek: #16621237
Tentang proyek
11 freelancer rata-rata menawar $163 untuk pekerjaan ini
I am an instructor of Mathematics. I have 5 years of teaching mathematics. I teach Trigonometry, Calculus, Geometry, Matrices, Algebra, Quantitative questions, Differential Equations, Logic, Discrete Mathematics, Numer Lebih banyak
I'm an Engineer in Statistics and Applied Economics, i've got many skills and expertise that will allow me achieving perfectly all the projects and assignments because my priority is your satisfaction I am a master of Lebih banyak
Hi there..... Warm Greetings We came along with your request for Subset Selection Problem (high level) and we reviewed your project description. We'd like to help you with confidence and satisfying results... Lebih banyak
Hello, I am Noel, a proficient statistician. I am proficient in statistical analysis and statistical software such as Excel, SPSS, and R Statistics. I am qualified to take up the project and would love to speak with yo Lebih banyak
Let me help you with this problem. i am an expert coder and really good with algos part Message me to discus this Thanks
I now how make it, i did it before. I am a Risk Engineer and had to many problems like that, for important companies like Repsol and Petrobras. I's not necesary macros, it can be done with equations, for easy modifi Lebih banyak
