메뉴 건너뛰기




Volumn 5, Issue 1-2, 2000, Pages 43-84

Localizer

Author keywords

Incremental algorithms; Local search; Modeling language

Indexed keywords


EID: 0038507539     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009818401322     Document Type: Article
Times cited : (46)

References (27)
  • 1
    • 0010309993 scopus 로고
    • On the Development of a General Algebraic Modeling System in a Strategic Planning Environment
    • Bisschop, J., and Meeraus, A. (1982). On the Development of a General Algebraic Modeling System in a Strategic Planning Environment. Mathematical Programming Study, 20:1-29.
    • (1982) Mathematical Programming Study , vol.20 , pp. 1-29
    • Bisschop, J.1    Meeraus, A.2
  • 2
    • 84976722628 scopus 로고
    • The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory
    • Borning, A. (1981). The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory. ACM Transaction on Programming Languages and Systems, 3(4):353-387.
    • (1981) ACM Transaction on Programming Languages and Systems , vol.3 , Issue.4 , pp. 353-387
    • Borning, A.1
  • 3
  • 4
    • 0037831147 scopus 로고
    • An Introduction to Prolog III
    • Colmerauer, A. (1990). An Introduction to Prolog III. Commun. ACM, 28(4):412-418.
    • (1990) Commun. ACM , vol.28 , Issue.4 , pp. 412-418
    • Colmerauer, A.1
  • 5
    • 34250074609 scopus 로고
    • Applying Tabu Search to the Job-Shop Scheduling Problem
    • Dell'Amico, M., and Trubian, M. (1993). Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research, 41:231-252.
    • (1993) Annals of Operations Research , vol.41 , pp. 231-252
    • DelL'Amico, M.1    Trubian, M.2
  • 8
    • 0042903473 scopus 로고
    • Oz - A Programming Language for Multi-Agent Systems
    • Ruzena Bajcsy, editor, Chambery, France, 30 August-3 September. Morgan Kaufmann Publishers
    • Henz, M., Smolka, G., and Würtz, J. (1993). Oz - A Programming Language for Multi-Agent Systems. In Ruzena Bajcsy, editor, 13th International Joint Conference on Artificial Intelligence, volume 1, pages 404-409, Chambery, France, 30 August-3 September. Morgan Kaufmann Publishers.
    • (1993) 13th International Joint Conference on Artificial Intelligence , vol.1 , pp. 404-409
    • Henz, M.1    Smolka, G.2    Würtz, J.3
  • 10
    • 0024770085 scopus 로고
    • Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
    • Johnson, D., Aragon, C., McGeoch, L., and Schevon, C. (1989). Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning. Operations Research, 37(6):865-893.
    • (1989) Operations Research , vol.37 , Issue.6 , pp. 865-893
    • Johnson, D.1    Aragon, C.2    McGeoch, L.3    Schevon, C.4
  • 11
    • 0001047763 scopus 로고
    • Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
    • Johnson, D., Aragon, C., McGeoch, L., and Schevon, C. (1991). Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Operations Research, 39(3):378-406.
    • (1991) Operations Research , vol.39 , Issue.3 , pp. 378-406
    • Johnson, D.1    Aragon, C.2    McGeoch, L.3    Schevon, C.4
  • 14
    • 0038292578 scopus 로고
    • PhD thesis, Dept. of Computer Science, New York University
    • Paige, R. (1981). Formal Differentiation. PhD thesis, Dept. of Computer Science, New York University.
    • (1981) Formal Differentiation
    • Paige, R.1
  • 15
    • 0022435467 scopus 로고
    • Programming with Invariants
    • January
    • Paige, R. (1986). Programming with Invariants. IEEE Software, January:56-69.
    • (1986) IEEE Software , pp. 56-69
    • Paige, R.1
  • 19
    • 0003350308 scopus 로고
    • A C++ Implementation of clp
    • November
    • Puget, J. F. (1994). A C++ Implementation of clp. In Proceedings of SPICIS, November.
    • (1994) Proceedings of SPICIS
    • Puget, J.F.1
  • 22
    • 0027001335 scopus 로고
    • A New Method for Solving Hard Satisfiability Problems
    • Selman, B., Levesque, H., and Mitchell, D. (1992). A New Method for Solving Hard Satisfiability Problems. In AAAI-92, pages 440-446.
    • (1992) AAAI-92 , pp. 440-446
    • Selman, B.1    Levesque, H.2    Mitchell, D.3
  • 23
    • 0042402667 scopus 로고    scopus 로고
    • Models for Using Stochastic Constraint Solvers in Constraint Logic Programming
    • Aachen, August
    • Stuckey, P., and Tam, V (1996). Models for Using Stochastic Constraint Solvers in Constraint Logic Programming. In PLILP-96, Aachen, August.
    • (1996) PLILP-96
    • Stuckey, P.1    Tam, V.2


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