메뉴 건너뛰기




Volumn 11, Issue 1, 1999, Pages 1-14

LOCALIZER: A modeling language for local search

Author keywords

Computer science software; Local search; Modeling language

Indexed keywords


EID: 0037831137     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.11.1.1     Document Type: Article
Times cited : (19)

References (12)
  • 1
    • 0030195677 scopus 로고    scopus 로고
    • New constructs for the description of combinatorial optimization problems in algebraic modeling languages
    • R. FOURER and J. BISSCHOP, 1996. New Constructs for the Description of Combinatorial Optimization Problems in Algebraic Modeling Languages. Computational Optimization and Applications 6, 83-116.
    • (1996) Computational Optimization and Applications , vol.6 , pp. 83-116
    • Fourer, R.1    Bisschop, J.2
  • 4
    • 0024770085 scopus 로고
    • Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning
    • D. JOHNSON, C. ARAGON, L. MCGEOCH, and C. SCHEVON, 1989. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning. Operations Research 37, 865-893.
    • (1989) Operations Research , vol.37 , pp. 865-893
    • Johnson, D.1    Aragon, C.2    McGeoch, L.3    Schevon, C.4
  • 5
    • 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, 1991. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Operations Research 39, 378-406.
    • (1991) Operations Research , vol.39 , pp. 378-406
    • Johnson, D.1    Aragon, C.2    McGeoch, L.3    Schevon, C.4
  • 6
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. KIRKPATRICK, C. GELATT, and M. VECCHI, 1983. Optimization by Simulated Annealing. Science 220, 671-680.
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.2    Vecchi, M.3
  • 7
    • 84914354863 scopus 로고
    • Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
    • S. MINTON, M. JOHNSTON, and A. PHILIPS, 1990. Solving Large-Scale Constraint Satisfaction and Scheduling Problems using a Heuristic Repair Method, AAAI-90, 17-24.
    • (1990) AAAI-90 , pp. 17-24
    • Minton, S.1    Johnston, M.2    Philips, A.3
  • 9
    • 0027706953 scopus 로고
    • An empirical study of greedy local search for satisfiability testing
    • B. SELMAN and H. KAUTZ, 1993. An Empirical Study of Greedy Local Search for Satisfiability Testing, AAAI-93, 46-51.
    • (1993) AAAI-93 , pp. 46-51
    • Selman, B.1    Kautz, H.2
  • 10
    • 0027001335 scopus 로고
    • A new method for solving hard satisfiability problems
    • B. SELMAN, H. LEVESQUE, and D. MITCHELL, 1992. A New Method for Solving Hard Satisfiability Problems, AAAI-92, 440-446.
    • (1992) AAAI-92 , pp. 440-446
    • Selman, B.1    Levesque, H.2    Mitchell, D.3
  • 11
    • 84957639285 scopus 로고    scopus 로고
    • Models for using stochastic constraint solvers in constraint logic programming
    • P. STUCKEY and V. TAM, 1996. Models for Using Stochastic Constraint Solvers in Constraint Logic Programming, PLILP-96, 423-437.
    • (1996) PLILP-96 , pp. 423-437
    • Stuckey, P.1    Tam, V.2


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