Operations Research, Machine Learning, Linear Optimization, Optimization, Dynamic Programming.
complexity is exponential. For a total of N players and a selection of M players at a total price of W, worst case complexity is O(N^M*M*W). Let’s assume that Ai denotes the i-th batsman, Bi the i-th bowler, Ci the i-th all rounder and Di the i-th wicket keeper. Also lets assumes that ai=1 if we