메뉴 건너뛰기




Volumn 1330, Issue , 1997, Pages 237-251

Localizer: A modeling language for local search

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; LEARNING ALGORITHMS; MODELING LANGUAGES;

EID: 84948961741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017443     Document Type: Conference Paper
Times cited : (29)

References (11)
  • 3
    • 0001047763 scopus 로고
    • Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
    • D. Johnson, C. Aragon, L. McGeoch, and C. Schevon. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Operations Research, 39(3):378-406, 1991.
    • (1991) Operations Research , vol.39 , Issue.3 , pp. 378-406
    • Johnson, D.1    Aragon, C.2    McGeoch, L.3    Schevon, C.4
  • 4
    • 26444479778 scopus 로고
    • Optimization by Simulated Annealing
    • S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by Simulated Annealing. Science, 220:671-680, 1983.
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.2    Vecchi, M.3
  • 5
    • 84914354863 scopus 로고
    • Solving Large-Scale Constraint Satisfaction and Scheduling Problems using a Heuristic Repair Method
    • August
    • S. Minton, M.D. Johnston, and A.B. Philips. Solving Large-Scale Constraint Satisfaction and Scheduling Problems using a Heuristic Repair Method. In AAAI-90, August 1990.
    • (1990) AAAI-90
    • Minton, S.1    Johnston, M.D.2    Philips, A.B.3
  • 7
    • 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, pages 46-51, 1993.
    • (1993) AAAI-93 , pp. 46-51
    • Selman, B.1    Kautz, H.2
  • 8
    • 0027001335 scopus 로고
    • A New Method for Solving Hard Satisfiability Problems
    • B. Selman, H. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. In AAAI-92, pages 440-446, 1992.
    • (1992) AAAI-92 , pp. 440-446
    • Selman, B.1    Levesque, H.2    Mitchell, D.3
  • 9
    • 0042402667 scopus 로고    scopus 로고
    • Models for Using Stochastic Constraint Solvers in Constraint Logic Programming
    • Aachen, August
    • P. Stuckey and V. Tam. Models for Using Stochastic Constraint Solvers in Constraint Logic Programming. In PLILP-96, Aachen, August 1996.
    • (1996) PLILP-96
    • Stuckey, P.1    Tam, V.2
  • 11
    • 0001119956 scopus 로고    scopus 로고
    • Partial Constraint Satisfaction Problems and Guided Local Search
    • London, April
    • C. Voudouris and E. Tsang. Partial Constraint Satisfaction Problems and Guided Local Search. In PACT-96, London, April 1996.
    • (1996) PACT-96
    • Voudouris, C.1    Tsang, E.2


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