Linear and quadratic programming approaches for the general graph partitioning problem

Journal of Global Optimization

Volumn 48, Issue 1, 2010, Pages 57-71

  Fan, Neng ^a   Pardalos, Panos M ^a  

^a University of Florida   (United States)

Author keywords

Bipartite graph partitioning; Graph partitioning; Linear programming; Quadratic programming

Indexed keywords

BICLUSTERING; BIPARTITE GRAPH PARTITIONING; BIPARTITE GRAPHS; CARDINALITIES; EQUIPARTITION; GENERAL GRAPH; GRAPH PARTITIONING; GRAPH PARTITIONING PROBLEMS; LINEAR INTEGER PROGRAMMING; NONEMPTY SUBSETS; QUADRATIC PROGRAMMING PROBLEMS; VERTEX SET; ZERO-ONE;

FUZZY CONTROL; INTEGER PROGRAMMING; LINEARIZATION; OPTIMIZATION; SET THEORY;

GRAPH THEORY;

EID: 77955510847     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-009-9520-1     Document Type: Article

References (29)

1. C.J. Alpert A.B. Kahng 1995 Recent directions in netlist partitioning: a survey Integr. VLSI J. 19 1-2 1 81 10.1016/0167-9260(95)00008-4
2. M. Boulle 2004 Compact mathematical formulation for graph partitioning Optim. Eng. 5 315 333 10.1023/B:OPTE.0000038889.84284.c7
3. S. Burer R.D.C. Monteiro Y. Zhang 2001 Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs SIAM J. Optim. 12 503 521 10.1137/S1052623400382467
4. W. Chaovalitwongse P.M. Pardalos O.A. Prokopyev 2004 A new linearization technique for multi-quadratic 0-1 programming problems Oper. Res. Lett. 32 517 522 10.1016/j.orl.2004.03.005
5. P. Chardaire A. Sutter 1995 A decomposition method for quadratic zero-one programming Manag. Sci. 41 4 704 712 10.1287/mnsc.41.4.704
6. ILOG CPLEX 11.0 Users Manual, (2007)
7. Elsner, U.: Graph partitioning-A survey. Technische Universitat Chemnitz, SFB393-Preprint 97-27 (1997)
8. Fan N., Chinchuluun A., Pardalos P.M.: Integer programming of biclustering based on graph models. In: Chinchuluun, A., Pardalos, P.M., Enkhbat, R., Tseveendorj, I. (eds) Optimization and Optimal Control: Theory and Applications, Springer, Berlin (2009)
9. Fan, N., Pardalos, P.M., Chinchuluun, A., Pistikopoulos, E.N.: Graph partitioning approaches for analyzing biological networks. In: BIOMAT 2009-International Symposium on Mathematical and Computational Biology, submitted (2009)
10. Fan, N., Pardalos, P.M.: Robust optimization of graph partitioning involving uncertainty, In preparation (2009)
11. P.-O. Fjallstrom 1998 Algorithms for graph partitioning: a survey Linkop. Elec. Articles Comput. Inf. Sci. 3 10
12. M.R. Garey D.S. Johnson L. Stockmeyer 1976 Some simplified NP-complete graph problems Theor. Comput. Sci. 1 237 267 10.1016/0304-3975(76)90059-1
13. W. Hager Y. Krylyuk 1999 Graph partitioning and continuous quadratic programming SIAM J. Discret. Math. 12 4 500 523 10.1137/S0895480199335829
14. W. Hager Y. Krylyuk 2002 Multiset graph partitioning Math. Meth. Oper. Res. 55 1 10 10.1007/s001860200173 (Pubitemid 34278819)
15. Karypis, G., Kumar, V.: Parallel multilevel graph partitioning. In: 10th International Parallel Processing Symposium (IPPS '96), 314 (1996)
16. G. Karypis R. Aggarwal V. Kumar S. Shekhar 1999 Multilevel hypergraph partitioning: applications in VLSI domain IEEE Trans. Very Larg. Scale Integr. (VLSI) Syst. 7 1 69 79 10.1109/92.748202
17. Karisch S.E., Rendl F.: Semidefinite programming and graph equipartition. In: Pardalos, P.M., Wolkowicz, H. (eds) Topics in Semidefinite and Interior-Point Methods, pp. 77-95. American Mathmatical Society, USA (1998)
18. B.W. Kernighan S. Lin 1970 An Efficient Heuristic Procedure for Partitioning Graphs Bell Syst. Tech. J. 49 1 291 307
19. G.A. Kochenberger F. Glover B. Alidaee C. Rego 2005 An unconstrained quadratic binary programming approach to the vertex coloring problem Ann. Oper. Res. 139 1 229 241 10.1007/s10479-005-3449-7 (Pubitemid 41361099)
20. A. Lisser F. Rendl 2003 Graph partitioning using linear and semidefinite programming Math. Program. Ser. B 95 91 101 10.1007/s10107-002-0342-x (Pubitemid 44757865)
21. A. Lodi K. Allemand T.M. Liebling 1999 An evolutionary heuristic for quadratic 0-1 programming Eur. J. Oper. Res. 119 3 662 670 10.1016/S0377- 2217(98)00359-2 (Pubitemid 30509799)
22. E.M. Loiola N.M.M. de Abreu P.O. Boaventura-Netto P. Hahn T. Querido 2007 A survey for the quadratic assignment problem Eur. J. Oper. Res. 176 2 657 690 10.1016/j.ejor.2005.09.032 (Pubitemid 44537635)
23. P.M. Pardalos G.P. Rodgers 1990 Computational aspects of a branch and bound algorithm for quadratic zero-one programming Computing 45 131 144 10.1007/BF02247879
24. S.E. Schaeffer 2007 Survey: graph clustering Comput. Sci. Rev. 1 27 64 10.1016/j.cosrev.2007.05.001
25. H.D. Sherali J.C. Smith 2007 An improved linearization strategy for zero-one quadratic programming problems Optim. Lett. 1 33 47 10.1007/s11590-006-0019-0
26. R.G. Strongin Ya, D. Sergeyev 1992 Global multidimensional optimization on parallel computer Parallel Comput. 18 1259 1273 10.1016/0167-8191(92)90069-J (Pubitemid 23614642)
27. R.G. Strongin Ya, D. Sergeyev 2003 Global optimization: fractal approach and non-redundant parallelism J. Glob. Optim. 27 1 25 50 10.1023/A:1024652720089
28. H. Wolkowicz Q. Zhao 1996 Semidefinite programming relaxations for the graph partitioning problem Discret. Appl. Math. 96-97 461 479
29. Zha, H., He, X., Ding, C., Simon, H., Gu, M.: Bipartite graph partitioning and data clustering. In: CIKM '01: Proceedings of the Tenth International Conference on Information and Knowledge Management, pp. 25-32. ACM Press, New York, NY (2001)