IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-07001-8_53.html
   My bibliography  Save this book chapter

An Optimal Placement of a Liaison with Short Communication Lengths Between Two Members of the Same Level in an Organization Structure of a Complete K-ary Tree

In: Operations Research Proceedings 2013

Author

Listed:
  • Kiyoshi Sawada

    (University of Marketing and Distribution Sciences)

Abstract

This paper proposes a model of placing a liaison which forms relations to two members in the same level of a pyramid organization structure when lengths between the liaison and the other members are less than those between members except the liaison in the organization such that the communication of information between every member in the organization becomes the most efficient. For a model of adding a node of liaison which gets adjacent to two nodes with the same depth in a complete $$K$$ K -ary tree of height $$H$$ H where the lengths of edges between the liaison and the other members are $$L(0

Suggested Citation

  • Kiyoshi Sawada, 2014. "An Optimal Placement of a Liaison with Short Communication Lengths Between Two Members of the Same Level in an Organization Structure of a Complete K-ary Tree," Operations Research Proceedings, in: Dennis Huisman & Ilse Louwerse & Albert P.M. Wagelmans (ed.), Operations Research Proceedings 2013, edition 127, pages 389-395, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-07001-8_53
    DOI: 10.1007/978-3-319-07001-8_53
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    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:oprchp:978-3-319-07001-8_53. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.