| _version_ |
1860796951280222208
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2024-10-02 15:25
|
| format |
Restricted Document
|
| id |
10804
|
| institution |
UniSZA
|
| internalnotes |
[1] Bomze, I. M., M. Budinich, P. M. Pardalos, M. Pelillo. 1999. The maximum clique problem. D.- Z. Du, P. M. Pardalos, eds. Handbook of Combinatorial Optimization, Vol. 4. Kluwer, Boston, 1–74. [2] Ostergard, P.R.J. 2002. A Fast Algorithm for the Maximum Clique Problem. Journal of Discrete Applied Mathematics, 120 (2002) 197-207. [3] Pardalos, P. M., J. Xue. 1994. The maximum clique problem. J. Global Optim. 4(3) 301–328. [4] Strickland, D. M. 2002. Maximum cliques with application to protein structure alignment. Ph.D. thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta. [5] Strickland, D. M. 2008. Teaching Note—Using the Maximum Clique Problem to Motivate Branch-and-Bound. INFORMS Transactions on Education 8(2), pp. 96–99. [6] Stix, V. 2001. Finding all Maximal Clique in Dynamic Graphs. Working Paper. Vienna University of Economics, Department of Information Business, Austria. [7] Tucker, A. 2002. Applied Combinatorics. Wiley, New York. [8] Wilson, R. 1996. Introduction to Graph Theory. Pearson Education, Harlow, England. [9] Winston, W. 2004. Operations Research_ Applications and Algorithms. Duxbury, Belmont, CA.
|
| originalfilename |
4934-01-FH02-FIK-14-00728.jpg
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=10804
|
| spelling |
10804 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=10804 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Article Journal image/jpeg inches 629 96 96 1343x629 1343 2024-10-02 15:25 4934-01-FH02-FIK-14-00728.jpg UniSZA Private Access Solution of maximum clique problem by using branch and bound method Applied Mathematical Sciences The maximum clique problems have been widely applied in the field of operations research. The maximum clique problem is finding a solution that is often considered difficult, as well as graph coloring problem, traveling salesman, and so forth. Solution the maximum clique can be done using several methods, such as by using brute force, backtracking, and branch and bound. This paper discusses the branch and bound procedure to solve the maximum clique problem. In the discussion of the method described on the upper and lower bound by implementing a greedy heuristic and branching procedure for determining the maximum clique (G) and minimum coloration (G) in the graph G. Solution the maximum clique problem with this method is beneficial because it provides an alternative perspective on branch and bound, but it is also because they do not need to explain software optimization. 8 1 81-90 [1] Bomze, I. M., M. Budinich, P. M. Pardalos, M. Pelillo. 1999. The maximum clique problem. D.- Z. Du, P. M. Pardalos, eds. Handbook of Combinatorial Optimization, Vol. 4. Kluwer, Boston, 1–74. [2] Ostergard, P.R.J. 2002. A Fast Algorithm for the Maximum Clique Problem. Journal of Discrete Applied Mathematics, 120 (2002) 197-207. [3] Pardalos, P. M., J. Xue. 1994. The maximum clique problem. J. Global Optim. 4(3) 301–328. [4] Strickland, D. M. 2002. Maximum cliques with application to protein structure alignment. Ph.D. thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta. [5] Strickland, D. M. 2008. Teaching Note—Using the Maximum Clique Problem to Motivate Branch-and-Bound. INFORMS Transactions on Education 8(2), pp. 96–99. [6] Stix, V. 2001. Finding all Maximal Clique in Dynamic Graphs. Working Paper. Vienna University of Economics, Department of Information Business, Austria. [7] Tucker, A. 2002. Applied Combinatorics. Wiley, New York. [8] Wilson, R. 1996. Introduction to Graph Theory. Pearson Education, Harlow, England. [9] Winston, W. 2004. Operations Research_ Applications and Algorithms. Duxbury, Belmont, CA.
|
| spellingShingle |
Solution of maximum clique problem by using branch and bound method
|
| summary |
The maximum clique problems have been widely applied in the field of operations research. The maximum clique problem is finding a solution that is often considered difficult, as well as graph coloring problem, traveling salesman, and so forth. Solution the maximum clique can be done using several methods, such as by using brute force, backtracking, and branch and bound. This paper discusses the branch and bound procedure to solve the maximum clique problem. In the discussion of the method described on the upper and lower bound by implementing a greedy heuristic and branching procedure for determining the maximum clique (G) and minimum coloration (G) in the graph G. Solution the maximum clique problem with this method is beneficial because it provides an alternative perspective on branch and bound, but it is also because they do not need to explain software optimization.
|
| title |
Solution of maximum clique problem by using branch and bound method
|
| title_full |
Solution of maximum clique problem by using branch and bound method
|
| title_fullStr |
Solution of maximum clique problem by using branch and bound method
|
| title_full_unstemmed |
Solution of maximum clique problem by using branch and bound method
|
| title_short |
Solution of maximum clique problem by using branch and bound method
|
| title_sort |
solution of maximum clique problem by using branch and bound method
|