Advanced Search
MyIDEAS: Login to save this article or follow this journal

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


Author Info

  • Michael Brusco


Registered author(s):


    No abstract is available for this item.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Springer in its journal Psychometrika.

    Volume (Year): 67 (2002)
    Issue (Month): 3 (September)
    Pages: 459-471

    as in new window
    Handle: RePEc:spr:psycho:v:67:y:2002:i:3:p:459-471

    Contact details of provider:
    Web page:

    Order Information:

    Related research

    Keywords: combinatorial optimization; branch and bound; seriation; anti-Robinson form;


    References listed on IDEAS
    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.:
    as in new window
    1. 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.
    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, vol. 63(4), pages 341-358, December.
    3. 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.
    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.
    as in new window

    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, vol. 70(2), pages 253-270, June.
    2. V. Choulakian, 2006. "Taxicab Correspondence Analysis," Psychometrika, Springer, vol. 71(2), pages 333-345, June.
    3. 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.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    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: (Guenther Eichhorn) or (Christopher F Baum).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.