메뉴 건너뛰기




Volumn 34, Issue 4, 2002, Pages 259-269

Finding the right hybrid algorithm - A combinatorial meta-problem

Author keywords

Clp; Combinatorial; Constraints

Indexed keywords


EID: 0141790754     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014450507312     Document Type: Article
Times cited : (14)

References (15)
  • 2
    • 84957009774 scopus 로고    scopus 로고
    • A Meta-heuristic factory for vehicle routing problems
    • Washington, DC
    • Y. Caseau, F. Laburthe and G. Silverstein, A Meta-heuristic factory for vehicle routing problems, in: Proc. CP '99, Washington, DC (1999).
    • (1999) Proc. CP '99
    • Caseau, Y.1    Laburthe, F.2    Silverstein, G.3
  • 3
    • 84957354082 scopus 로고    scopus 로고
    • Language for search algorithms
    • Pisa
    • Y. Caseau and F. Laburthe, SALSA: A Language for Search Algorithms, in: Proc. CP '98, Pisa (1998) pp. 310-324.
    • (1998) Proc. CP '98 , pp. 310-324
    • Caseau, Y.1    Laburthe, F.2    Salsa, A.3
  • 4
    • 0012316289 scopus 로고    scopus 로고
    • Look-ahead versus look-back for satisfiability problems
    • Linz
    • Chu Min Li and Anbulagan, Look-ahead versus look-back for satisfiability problems, in: Proc. CP '97, Linz (1997).
    • (1997) Proc. CP '97
    • Li, C.M.1    Anbulagan2
  • 5
    • 0034288713 scopus 로고    scopus 로고
    • Probe backtrack search for minimal perturbation in dynamic scheduling
    • H. El Sakkout and M. Wallace, Probe backtrack search for minimal perturbation in dynamic scheduling, Constraints 5(4) (2000).
    • (2000) Constraints , vol.5 , Issue.4
    • El Sakkout, H.1    Wallace, M.2
  • 7
    • 0037828088 scopus 로고    scopus 로고
    • LOCALIZER: A modelling language for local search
    • Linz
    • L. Michel and P. Van Hentenryck, LOCALIZER: A modelling language for local search, in: Proc. CP '97, Linz (1997).
    • (1997) Proc. CP '97
    • Michel, L.1    Van Hentenryck, P.2
  • 8
    • 0030232147 scopus 로고    scopus 로고
    • Automatically configuring constraint satisfaction problems: A case study
    • S. Minton, Automatically configuring constraint satisfaction problems: A case study, Constraints 1 (1996) 7-44.
    • (1996) Constraints , vol.1 , pp. 7-44
    • Minton, S.1
  • 9
    • 44049112032 scopus 로고
    • Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
    • S. Minton, M. Johnstone, A. Philips and P. Laird, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, Artif. Intell. 58 (1992) 161-206.
    • (1992) Artif. Intell. , vol.58 , pp. 161-206
    • Minton, S.1    Johnstone, M.2    Philips, A.3    Laird, P.4
  • 10
    • 0005860229 scopus 로고    scopus 로고
    • Nonsystematic search and learning: An empirical study
    • Pisa
    • E.T. Richards and E.B. Richards, Nonsystematic search and learning: An empirical study, in: Proc. CP '98, Pisa (1998).
    • (1998) Proc. CP '98
    • Richards, E.T.1    Richards, E.B.2
  • 11
    • 0004745315 scopus 로고    scopus 로고
    • A generic model and hybrid algorithm for hoist scheduling problems
    • Pisa
    • R. Rodosek and M. Wallace, A generic model and hybrid algorithm for hoist scheduling problems, in: Proc. CP '98, Pisa (1998).
    • (1998) Proc. CP '98
    • Rodosek, R.1    Wallace, M.2
  • 13
    • 0027706953 scopus 로고
    • An empirical study of greedy local search for satisfiability testing
    • B. Selman and H. Kautz, An empirical study of greedy local search for satisfiability testing, in: AAAI-93 (1993) pp. 46-51.
    • (1993) AAAI-93 , pp. 46-51
    • Selman, B.1    Kautz, H.2


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