EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
4310. Adding Relations between a Delegate and Every Other Member of the Same Level in a Complete K-ary Linking Pin Organization Structure
Invited abstract in session WD-29: Optimization issues on graphs II (Contributed), stream Combinatorial Optimization.
Wednesday, 14:30-16:00Room: 157 (building: 208)
Authors (first author is the speaker)
| 1. | Kiyoshi Sawada
|
| Department of Economic Information, University of Marketing and Distribution Sciences |
Abstract
A linking pin organization is a structure in which relations between members of the same section are added to a pyramid organization where there exist only relations between each superior and his direct subordinates. This study proposes a model of adding relations between a delegate and every other member of the same level in a complete K-ary linking pin organization structure where every pair of nodes which have the same parent in a complete K-ary tree is adjacent. When edges between one node and every other node of depth N in a complete K-ary linking pin organization structure of height H are added, the total shortening distance which is the sum of shortening lengths of shortest paths between every pair of all nodes by adding edges is formulated. An optimal depth N such that the communication of information between every member in the organization becomes the most efficient is obtained by maximizing the total shortening distance.
Keywords
- Optimization Modeling
- Graphs and Networks
- Combinatorial Optimization
Status: accepted
Back to the list of papers