Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs

Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs

0.00 Avg rating0 Votes
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: , , , ,
Keywords: programming: integer, graphs
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.