IDEAS home Printed from
   My bibliography  Save this article

Compact integer-programming models for extracting subsets of stimuli from confusion matrices


  • Michael Brusco


  • Stephanie Stahl


No abstract is available for this item.

Suggested Citation

  • Michael Brusco & Stephanie Stahl, 2001. "Compact integer-programming models for extracting subsets of stimuli from confusion matrices," Psychometrika, Springer;The Psychometric Society, vol. 66(3), pages 405-419, September.
  • Handle: RePEc:spr:psycho:v:66:y:2001:i:3:p:405-419
    DOI: 10.1007/BF02294442

    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. Fred Glover, 1975. "Improved Linear Integer Programming Formulations of Nonlinear Integer Problems," Management Science, INFORMS, vol. 22(4), pages 455-460, December.
    2. Comley, Warwick J., 1996. "QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm," European Journal of Operational Research, Elsevier, vol. 95(2), pages 420-426, December.
    3. J. Kruskal, 1964. "Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis," Psychometrika, Springer;The Psychometric Society, vol. 29(1), pages 1-27, March.
    4. Hamdy A. Taha, 1972. "A Balasian-Based Algorithm for Zero-One Polynomial Programming," Management Science, INFORMS, vol. 18(6), pages 328-343, February.
    5. Roger Shepard, 1957. "Stimulus and response generalization: A stochastic model relating generalization to distance in psychological space," Psychometrika, Springer;The Psychometric Society, vol. 22(4), pages 325-345, 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. Douglas Steinley & Lawrence Hubert, 2008. "Order-Constrained Solutions in K-Means Clustering: Even Better Than Being Globally Optimal," Psychometrika, Springer;The Psychometric Society, vol. 73(4), pages 647-664, December.


    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:66:y:2001:i:3:p:405-419. 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.