Technical Note—Minimizing a Function of Permutations of n Integers

John G. Rau
Additional contact information
John G. Rau: North American Rockwell Corporation, Anaheim, California

Operations Research, 1971, vol. 19, issue 1, 237-240

Abstract: 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.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.237 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:1:p:237-240

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().