Optimal Weighted Ancestry Relationships

Fred Glover, T. Klastorin and D. Kongman
Additional contact information
Fred Glover: University of Colorado
T. Klastorin: Wake Forest University
D. Kongman: University of Texas

Management Science, 1974, vol. 20, issue 8, 1190-1193

Abstract: A solution method is given for a class of practical optimization problems requiring the determination of a consistent partial ordering for sets of objects, events, preferences, and the like. These problems are characterized by the existence of "noisy" (or contradictory) links of varying strengths. The origin of this class of problems is an anthropological study in which it is desired to specify a global chronological ordering of ancient cemetery data. A mathematical formulation is given which results in a minimum weight feedback model. A heuristic is developed similar to the Greedy algorithm for minimum weight spanning trees which requires only one pass through the network.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.8.1190 (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:ormnsc:v:20:y:1974:i:8:p:1190-1193

Access Statistics for this article

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