Article ID: | iaor20023497 |
Country: | United States |
Volume: | 110 |
Issue: | 3 |
Start Page Number: | 545 |
End Page Number: | 556 |
Publication Date: | Sep 2001 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Du D.Z., Fu H.L., Shiue C.L., Cheng X., Kim J.M. |
Keywords: | programming: integer, graphs |
In this paper, we study the chaotic mappings of complete multipartite graphs. The problem is reduced to a quadratic integer programming problem. We characterize its optimal solution and present an algorithm running in O(n5log(n)) time, when n is the total number of vertices in a complete multipartite graph.