A METHOD FOR GENERATING COMBINATIONS IN A CHANGING ENVIRONMENT WITHOUT REPEATING ALREADY GENERATED COMBINATIONS
Original Publication Date: 2003-Nov-19
Included in the Prior Art Database: 2003-Nov-19
There are applications that require to select k out of n elements such that the selected elements satisfy some function. For example consider the problem of selecting k out of n courses such that no two courses' schedule overlap. Assume there is no preference of any course above any other courses . This invention offers a method to find the first combination and then the next combination from the last combination that has been computed.