메뉴 건너뛰기
Journal of Heuristics
Volumn 19, Issue 4, 2013, Pages 565-571
Solving large scale max cut problems via tabu search
Author keywords

Combinatorial optimization; Max Cut problem; Metaheuristics
Indexed keywords

BINARY PROGRAMS; MAX-CUT; MAX-CUT PROBLEM; META HEURISTICS; TABU SEARCH ALGORITHMS; TEST PROBLEM;
EID: 84880918833     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-011-9189-8     Document Type: Article
Times cited : (71)
References (12)
  • 1
    • 0042456012 scopus 로고
    • The Max-Cut problem and quadratic 0-1 optimization; Polyhedral aspects, relaxations and bounds
    • 1140978 0741.90077 10.1007/BF02115753
    • Boros, E., Hammer, P.: The Max-Cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. 33, 151-180 (1991)
    • (1991) Ann. Oper. Res. , vol.33 , pp. 151-180
    • Boros, E.1    Hammer, P.2
  • 2
    • 0036013024 scopus 로고    scopus 로고
    • Rank-two relaxation heuristic for Max-Cut and other binary quadratic programs
    • 1885573 1152.90532 10.1137/S1052623400382467
    • Burer, S., Monteiro, D., Zang, Y.: Rank-two relaxation heuristic for Max-Cut and other binary quadratic programs. SIAM J. Optim. 12, 503-521 (2001)
    • (2001) SIAM J. Optim. , vol.12 , pp. 503-521
    • Burer, S.1    Monteiro, D.2    Zang, Y.3
  • 4
    • 0036931940 scopus 로고    scopus 로고
    • Randomized heuristics for the Max-Cut problem
    • 1960518 10.1080/1055678021000090033
    • Festa, P., Pardalos, P., Resende, M., Ribeiro, C.: Randomized heuristics for the Max-Cut problem. Optim. Methods Softw. 7, 1033-1058 (2002)
    • (2002) Optim. Methods Softw. , vol.7 , pp. 1033-1058
    • Festa, P.1    Pardalos, P.2    Resende, M.3    Ribeiro, C.4
  • 5
    • 77957312322 scopus 로고    scopus 로고
    • Diversification-driven tabu search for unconstrained binary quadratic problems
    • 10.1007/s10288-009-0115-y
    • Glover, F., Lü, Z., Hao, J.K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR, Q. J. Oper. Res. (2010). doi: 10.1007/s10288-009-0115-y
    • (2010) 4OR, Q. J. Oper. Res.
    • Glover, F.1    Lü, Z.2    Hao, J.K.3
  • 6
    • 84893574327 scopus 로고
    • Improved approximation algorithms for Max-Cut and satisfiability problems using Semidefinite programming
    • 1412228 0885.68088 10.1145/227683.227684
    • Goemans, M., Williamson, D.: Improved approximation algorithms for Max-Cut and satisfiability problems using Semidefinite programming. J. ACM 42, 1115-1145 (1995)
    • (1995) J. ACM , vol.42 , pp. 1115-1145
    • Goemans, M.1    Williamson, D.2
  • 8
    • 0012313875 scopus 로고    scopus 로고
    • Solving graph bisection problems with semidefinite programming
    • Karish, S., Rendl, F., Clausen, J.: Solving graph bisection problems with semidefinite programming. SIAM J. Comput. 12, 177-191 (2000)
    • (2000) SIAM J. Comput. , vol.12 , pp. 177-191
    • Karish, S.1    Rendl, F.2    Clausen, J.3
  • 9
    • 32544446882 scopus 로고    scopus 로고
    • A semidefinite programming based polyhedral cut and price approach for the Max-Cut problem
    • 2209467 1103.90074 10.1007/s10589-005-5958-3
    • Krishnan, K., Mitchell, J.: A semidefinite programming based polyhedral cut and price approach for the Max-Cut problem. Comput. Optim. Appl. 33, 51-71 (2006)
    • (2006) Comput. Optim. Appl. , vol.33 , pp. 51-71
    • Krishnan, K.1    Mitchell, J.2
  • 10
    • 67650002143 scopus 로고    scopus 로고
    • Advanced scatter search for the Max-Cut problem
    • 2549056 1243.90227 10.1287/ijoc.1080.0275
    • Marti, R., Duarte, A., Laguna, M.: Advanced scatter search for the Max-Cut problem. INFORMS J. Comput. 21, 26-38 (2009)
    • (2009) INFORMS J. Comput. , vol.21 , pp. 26-38
    • Marti, R.1    Duarte, A.2    Laguna, M.3
  • 11
    • 77954940445 scopus 로고    scopus 로고
    • Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
    • 2524893 10.1007/s10107-008-0235-8
    • Rendl, F., Rinaldi, G., Wiegele, A.: Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121, 307-335 (2008)
    • (2008) Math. Program. , vol.121 , pp. 307-335
    • Rendl, F.1    Rinaldi, G.2    Wiegele, A.3
  • 12
    • 57049162750 scopus 로고
    • The Max-Cut problem: A survey
    • W. Cook L. Lovasz Seymour (eds) DIMACS Series in Discrete Mathematics and Computer Science Am. Math. Soc. Providence
    • Poljak, S., Tuza, Z.: The Max-Cut problem: a survey. In: Cook, W., Lovasz, L., Seymour, P. (eds.) Special Year on Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Computer Science. Am. Math. Soc., Providence (1995)
    • (1995) Special Year on Combinatorial Optimization
    • Poljak, S.1    Tuza, Z.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.