메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 35-36

Solving Weighted Max-Sat optimization problems using a Taboo scatter search metaheuristic

Author keywords

Hybrid metaheuristic; Max W Sat; SAT; Scatter Search; Solution combination method; Taboo Search

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING;

EID: 2442501632     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.967910     Document Type: Conference Paper
Times cited : (5)

References (11)
  • 5
    • 0016349356 scopus 로고
    • Approximation algorithms for combinatorial problems
    • Johnson. S, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences 9, 256-278, 1974.
    • (1974) Journal of Computer and System Sciences , vol.9 , pp. 256-278
    • Johnson, S.1
  • 6
    • 2442529443 scopus 로고
    • Algorithms for the maximum satisfiability
    • 44-279-303
    • Hansen P; Jaumard. B, Algorithms for the Maximum Satisfiability, journal of computing 44-279-303, 1990.
    • (1990) Journal of Computing
    • Hansen, P.1    Jaumard, B.2
  • 9
    • 2442465494 scopus 로고    scopus 로고
    • Internet Document Graduate school of business, University of Colorado, Boulder August 16
    • Laguna .M, Glover. F Scatter Search, Internet Document Graduate school of business, University of Colorado, Boulder August 16, 1999.
    • (1999) Scatter Search
    • Laguna, M.1    Glover, F.2


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