Skip to main content
SpringerLink
Log in

Branch-and-bound applications in combinatorial data analysis

  • Published:
Psychometrika Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., & Schrijver, A. (1998). Combinatorial optimization. New York: Wiley.

    Google Scholar 

  • Defays, D. (1978). A short note on a method of seriation. British Journal of Mathematical and Statistical Psychology, 3, 49–53.

    Article  Google Scholar 

  • De Leeuw, J., & Heiser, W. (1977). Convergence of correction-matrix algorithms for multidimensional scaling. In J.C. Lingoes, E.E. Roskam, & I. Borg (Eds.), Geometric representations of relational data (pp. 735–752). Ann Arbor, MI: Mathesis Press.

    Google Scholar 

  • Hubert, L.J., & Arabie, P. (1986). Unidimensional scaling and combinatorial optimization. In J. de Leeuw, J. Meulman, W. Heiser, & F. Critchley (Eds.), Multidimensional data analysis (pp. 181–196). Leiden, The Netherlands: DSWO Press.

    Google Scholar 

  • Hubert, L.J., & Arabie, P. (1988). Relying on necessary conditions for optimization: Unidimensional scaling and some extensions. In H.H. Bock (Ed.), Classification and related methods of data analysis (pp. 463–472). Amsterdam: Elsevier.

    Google Scholar 

  • Hubert, L.J., Arabie, P., & Meulman, J. (2001). Combinatorial data analysis: Optimization by dynamic programming. Philadelphia: SIAM.

    Book  Google Scholar 

  • Hubert, L.J., & Baker, F.B. (1978). Applications of combinatorial programming to data analysis: The travelling salesman and related problems. Psychometrika, 43, 81–91.

    Article  Google Scholar 

  • Nemhauser, G.L., & Wolsey, L.A. (1998). Integer and combinatorial optimization. New York: Wiley.

    Google Scholar 

  • Papadimitriou, C.H., & Steiglitz, K. (1998). Combinatorial optimization: Algorithms and complexity. Mineola, New York: Dover.

    Google Scholar 

  • Parker, G.R., & Rardin, R.L. (1988). Discrete optimization. Boston: Academic Press.

    Google Scholar 

  • Ramsay, J. (2004). Review: L. Hubert, P. Arabie, & J. Meulman (2001). Combinatorial data analysis: Optimization by dynamic programming. Psychometrika, 69, 499.

    Article  Google Scholar 

  • Schrijver, A. (2003). Combinatorial optimization. Berlin: Springer.

    Google Scholar 

  • Van Os, B.J. (2000). Dynamic programming for partitioning in multivariate data analysis. Leiden University (Veenendaal: Universal Press).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Illinois, Urbana-Champaign, USA

    Hans-Friedrich Köhn

Authors
  1. Hans-Friedrich Köhn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Köhn, HF. Branch-and-bound applications in combinatorial data analysis. Psychometrika 71, 411–413 (2006). https://doi.org/10.1007/s11336-005-1378-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11336-005-1378-7

Search

Navigation