11/30/2023 0 Comments While loop matlabit would take several hundred years to complete. Brute force evaluation is, obviously, impossible, ie. The issue is the actual problem I need to solve is 400 choose 16, which is results in just under 3 trillion possible permutations. The code runs quite well for problems of the size of 90 choose 6, which results in about 1.2 billion possible permutations but solves in about 2 mins. It, as far as I can tell, finds the global optimal of a subset selection problem while satisfying any included constraints. The code I wrote is a branch and bound algorithm with constraint handling. Hello all, I am the one who asked the question initially, decided to open up an account to address this.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |