IDEAS home Printed from
   My bibliography  Save this article

An r-Dimensional Quadratic Placement Algorithm


  • Kenneth M. Hall

    (Department of General Services, State of California)


In this paper the solution to the problem of placing n connected points (or nodes) in r-dimensional Euclidean space is given. The criterion for optimality is minimizing a weighted sum of squared distances between the points subject to quadratic constraints of the form X'X - 1, for each of the r unknown coordinate vectors. It is proved that the problem reduces to the minimization of a sum or r positive semi-definite quadratic forms which, under the quadratic constraints, reduces to the problem of finding r eigenvectors of a special "disconnection" matrix. It is shown, by example, how this can serve as a basis for cluster identification.

Suggested Citation

  • Kenneth M. Hall, 1970. "An r-Dimensional Quadratic Placement Algorithm," Management Science, INFORMS, vol. 17(3), pages 219-229, November.
  • Handle: RePEc:inm:ormnsc:v:17:y:1970:i:3:p:219-229

    Download full text from publisher

    File URL:
    Download Restriction: no


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

    Cited by:

    1. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    2. Amaral, Andre R.S., 2006. "On the exact solution of a facility layout problem," European Journal of Operational Research, Elsevier, vol. 173(2), pages 508-518, September.
    3. Gautier M. Krings & Jean-Franc{c}ois Carpantier & Jean-Charles Delvenne, 2013. "Trade integration and trade imbalances in the European Union: a network perspective," Papers 1309.4156,
    4. Nascimento, Mariá C.V. & de Carvalho, André C.P.L.F., 2011. "Spectral methods for graph clustering - A survey," European Journal of Operational Research, Elsevier, vol. 211(2), pages 221-231, June.
    5. Philipp Hungerländer & Franz Rendl, 2013. "A computational study and survey of methods for the single-row facility layout problem," Computational Optimization and Applications, Springer, vol. 55(1), pages 1-20, May.
    6. Bhupatiraju, Samyukta & Nomaler, Önder & Triulzi, Giorgio & Verspagen, Bart, 2012. "Knowledge flows – Analyzing the core literature of innovation, entrepreneurship and science and technology studies," Research Policy, Elsevier, vol. 41(7), pages 1205-1218.

    More about this item


    Access and download statistics


    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:inm:ormnsc:v:17:y:1970:i:3:p:219-229. 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: (Mirko Janc). 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.

    We have no references for this item. You can help adding them by using 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.