Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
For a certain class of combinatorial optimization problems the author introduces an exchange pairs (EP) set. Using the EP set the author constructs some sort of gradient and solves the problem by a variant of a greedy method. The computational complexity of the greedy method depends heavily on the complexity of constructing a generation set for the EP set.
scientific article; zbMATH DE number 3916022