Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
| dc.citation.epage | 556 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 545 | en_US |
| dc.citation.volume | 110 | en_US |
| dc.citation.woscount | 8 | |
| dc.contributor.author | Fu, HL | en_US |
| dc.contributor.author | Shiue, CL | en_US |
| dc.contributor.author | Cheng, X | en_US |
| dc.contributor.author | Du, DZ | en_US |
| dc.contributor.author | Kim, JM | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:43:28Z | |
| dc.date.available | 2014-12-08T15:43:28Z | |
| dc.date.issued | 2001-09-01 | en_US |
| dc.description.abstract | Let a be a permutation of the vertex set V(G) of a connected graph G. Define the total relative displacement of alpha in G by [GRAPHIC] where d(G) (x, y) is the length of the shortest path between x and y in G. Let pi*(G) be the maximum value of delta (alpha)(G) among all permutations of V(G). The permutation which realizes pi*(G) is called a chaotic mapping of G. 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(n(5) log n) time, where n is the total number of vertices in a complete multipartite graph. | en_US |
| dc.identifier.doi | 10.1023/A:1017584227417 | en_US |
| dc.identifier.issn | 0022-3239 | en_US |
| dc.identifier.journal | JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1023/A:1017584227417 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/29429 | |
| dc.identifier.wosnumber | WOS:000171212900004 | |
| dc.language.iso | en_US | en_US |
| dc.subject | chaotic mapping | en_US |
| dc.subject | complete multipartite graph | en_US |
| dc.subject | quadratic integer programming | en_US |
| dc.subject | optimal solution | en_US |
| dc.title | Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs | en_US |
| dc.type | Article | en_US |