메뉴 건너뛰기




Volumn 1606, Issue , 1999, Pages 700-708

Randomness in heuristics: An experimental investigation for the maximum satisfiability problem

(1)  Drias, H a  

a NONE

Author keywords

Genetic algorithm; Heuristics; Local search; Maximum satisfiability; Randomness; Tabu search

Indexed keywords

ALGORITHMS; FORMAL LOGIC; GENETIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); RANDOM PROCESSES; TABU SEARCH;

EID: 84902203051     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0098228     Document Type: Conference Paper
Times cited : (3)

References (26)
  • 5
    • 0020766331 scopus 로고
    • An overview of computational complexity
    • S.A. Cook, ’An overview of computational complexity’, communications of the ACM, vol 26, 6(1983), 401-408.
    • (1983) Communications of the ACM , vol.26 , Issue.6 , pp. 401-408
    • Cook, S.A.1
  • 8
    • 84947801631 scopus 로고    scopus 로고
    • A Monte Carlo algorithm for the satisfiability problem
    • Springer Verlag Benicassim, Spain, (June
    • II. Drias, A Monte Carlo algorithm for the satisfiability problem, in Proc of IEA-A1E 98, lectures notes in Artificial Intelligence, Springer Verlag Benicassim, Spain, (June 1998).
    • (1998) Proc of IEA-A1E 98, Lectures Notes in Artificial Intelligence
    • Drias, I.I.1
  • 12
    • 0028368125 scopus 로고
    • Genetic algorithms and Tabu search: Hybrids for optimization
    • F. Glover, J.P. Kelly and M. Laguna, ’Genetic algorithms and Tabu search: Hybrids for optimization’, Computers op Res, voi 22 1(1995), 111-134.
    • (1995) Computers Op Res, Voi , vol.22 , Issue.1 , pp. 111-134
    • Glover, F.1    Kelly, J.P.2    Laguna, M.3
  • 13
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
    • M.X. Goemans and D.P. Williamson, ’ Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming’, Journal of the ACM, 42(1995), 1115-1145
    • (1995) Journal of the ACM , vol.42 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 15
    • 0028444541 scopus 로고
    • Global Optimization for satisfiability (SAT) Problem
    • J. Gu, ’Global Optimization for satisfiability (SAT) Problem’, IEEE Transactions on knowledge and data engineering, voi 6, 3(1994), 361-381
    • (1994) IEEE Transactions on Knowledge and Data Engineering , vol.6 , Issue.3 , pp. 361-381
    • Gu, J.1
  • 16
    • 0025260212 scopus 로고
    • Algorithms for the maximum satisfiability problem
    • P. Hansen and B. Jaumard, ’Algorithms for the maximum satisfiability problem’, computing, 44(1990), 279-303.
    • (1990) Computing , vol.44 , pp. 279-303
    • Hansen, P.1    Jaumard, B.2
  • 19
    • 84976762344 scopus 로고
    • Complexity of partial satisfaction
    • K.J. Lieberherr and E. Specker, ’ Complexity of partial satisfaction’, Journal of the ACM, voi 28 2(1981), 411-421.
    • (1981) Journal of the ACM , vol.28 , Issue.2 , pp. 411-421
    • Lieberherr, K.J.1    Specker, E.2
  • 23
    • 0347557519 scopus 로고
    • A polynomial algorithm for constructing a large bipartite subgraph with an application to a satisfiability problem
    • S. Poljnk and I, Turzik, ’A polynomial algorithm for constructing a large bipartite subgraph with an application to a satisfiability problem’, Can Journ Math, vol 34, 3(1982),519-524.
    • (1982) Can Journ Math , vol.34 , Issue.3 , pp. 519-524
    • Poljnk, S.1


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