메뉴 건너뛰기




Volumn 6, Issue 3, 2002, Pages 237-270

Geometry of semidefinite Max-Cut relaxations via matrix ranks

Author keywords

Discrete optimization; Lagrangian relaxation; Max Cut problem; Semidefinite programming

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

EID: 0036722276     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014895808844     Document Type: Article
Times cited : (15)

References (36)
  • 26
    • 0036013026 scopus 로고    scopus 로고
    • Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure
    • electronic publication
    • (2001) SIAM J. Optim. , vol.12 , pp. 345-375
    • Laurent, M.1
  • 36
    • 0000549997 scopus 로고    scopus 로고
    • Approximating quadratic programming with bound and quadratic constraints
    • (1999) Math. Programming , vol.84 , pp. 219-226
    • Ye, Y.1


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