A branch-and-bound algorithm for fitting anti-robinson structures to symmetric dissimilarity matrices
No abstract is available for this item.
Volume (Year): 67 (2002)
Issue (Month): 3 (September)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=112911|
|Order Information:||Web: http://link.springer.de/orders.htm|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lawrence Hubert & Phipps Arabie & Jacqueline Meulman, 1998. "Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices," Psychometrika, Springer, vol. 63(4), pages 341-358, December.
- L. Hubert & R. Golledge, 1981. "Matrix reorganization and dynamic programming: Applications to paired comparisons and unidimensional seriation," Psychometrika, Springer, vol. 46(4), pages 429-441, December.
- Lawrence Hubert & Phipps Arabie, 1995. "The approximation of two-mode proximity matrices by sums of order-constrained matrices," Psychometrika, Springer, vol. 60(4), pages 573-605, December.
When requesting a correction, please mention this item's handle: RePEc:spr:psycho:v:67:y:2002:i:3:p:459-471. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.