IDEAS home Printed from
   My bibliography  Save this article

A branch-and-bound algorithm for fitting anti-robinson structures to symmetric dissimilarity matrices


  • Michael Brusco



No abstract is available for this item.

Suggested Citation

  • Michael Brusco, 2002. "A branch-and-bound algorithm for fitting anti-robinson structures to symmetric dissimilarity matrices," Psychometrika, Springer;The Psychometric Society, vol. 67(3), pages 459-471, September.
  • Handle: RePEc:spr:psycho:v:67:y:2002:i:3:p:459-471
    DOI: 10.1007/BF02294996

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. L. Hubert & R. Golledge, 1981. "Matrix reorganization and dynamic programming: Applications to paired comparisons and unidimensional seriation," Psychometrika, Springer;The Psychometric Society, vol. 46(4), pages 429-441, December.
    2. 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;The Psychometric Society, vol. 63(4), pages 341-358, December.
    3. Lawrence Hubert & Phipps Arabie, 1995. "The approximation of two-mode proximity matrices by sums of order-constrained matrices," Psychometrika, Springer;The Psychometric Society, vol. 60(4), pages 573-605, December.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Michael Brusco & Stephanie Stahl, 2005. "Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming," Psychometrika, Springer;The Psychometric Society, vol. 70(2), pages 253-270, June.
    2. Köhn, Hans-Friedrich, 2010. "Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition," Computational Statistics & Data Analysis, Elsevier, vol. 54(10), pages 2343-2357, October.
    3. V. Choulakian, 2006. "Taxicab Correspondence Analysis," Psychometrika, Springer;The Psychometric Society, vol. 71(2), pages 333-345, June.
    4. Pascal Préa & Dominique Fortin, 2014. "An Optimal Algorithm To Recognize Robinsonian Dissimilarities," Journal of Classification, Springer;The Classification Society, vol. 31(3), pages 351-385, October.


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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 (Rebekah McClure). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.