Operations Research · 1971 · 27 citations · 0 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsOptimizationCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingNumber-theoretic AlgorithmsCombinatorial SearchPermutation TestingPermutation TestsSequential Search
This note discusses sufficient conditions for a function of permutations (j 1 , …, j n ) of the integers 1, 2, …, n to have a minimum at the permutation (j* 1 , …, j* n ) and derives a solution algorithm that is equivalent to the known solution algorithm for special cases involving sequential search and testing.