메뉴 건너뛰기




Volumn 1, Issue 2, 2000, Pages 285-320

Search and Strategies in OPL

Author keywords

Combinatorial; Constraint Programming; Design; Languages; Modeling Languages; Optimization; Search

Indexed keywords


EID: 84976509455     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/359496.359529     Document Type: Article
Times cited : (49)

References (34)
  • 3
    • 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
  • 5
    • 0001013257 scopus 로고
    • A Practical Use of Jackson's Preemptive Schedule for Solving the Job-Shop Problem
    • Carlier, J. and Pinson, E. 1990. A Practical Use of Jackson's Preemptive Schedule for Solving the Job-Shop Problem. Annals of Operations Research 26, 269-287.
    • (1990) Annals of Operations Research , vol.26 , pp. 269-287
    • Carlier, J.1    Pinson, E.2
  • 7
    • 0011758397 scopus 로고
    • An Introduction to Prolog III
    • Colmerauer, A. 1990. An Introduction to Prolog III. Commun. ACM28, 4, 412-418.
    • (1990) Commun. ACM28 , vol.4 , pp. 412-418
    • Colmerauer, A.1
  • 8
    • 0005873154 scopus 로고    scopus 로고
    • Specification de Prolog IV
    • Laboratoire d'informatique de Marseille.
    • COLMERAUER, A. 1996. Specification de Prolog IV. Technical report, Laboratoire d'informatique de Marseille.
    • (1996) Technical report
    • COLMERAUER, A.1
  • 9
    • 0002907360 scopus 로고
    • A Branch and Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
    • Demeulesmeester, E. and Herroelen, W. 1992. A Branch and Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Management Science 38, 1803-1818.
    • (1992) Management Science , vol.38 , pp. 1803-1818
    • Demeulesmeester, E.1    Herroelen, W.2
  • 14
    • 0004141533 scopus 로고    scopus 로고
    • Ilog SA, Gentilly, France
    • ILOG OPL STUDIO 3.0. 2000. Reference Manual. Ilog SA, Gentilly, France.
    • (2000) Reference Manual.
  • 15
    • 0004141536 scopus 로고    scopus 로고
    • Ilog SA, Gentilly, France.
    • ILOG SOLVER 4.4. 1998. Reference Manual. Ilog SA, Gentilly, France.
    • (1998) Reference Manual.
  • 18
    • 0002342841 scopus 로고
    • Logic Semantics for a Class of Committed-Choice Programs
    • (Melbourne, Australia, May 1987)
    • Maher, M. 1987. Logic Semantics for a Class of Committed-Choice Programs. In Fourth International Conference on Logic Programming (Melbourne, Australia, May 1987), pp. 858-876.
    • (1987) Fourth International Conference on Logic Programming , pp. 858-876
    • Maher, M.1
  • 20
    • 0037493628 scopus 로고
    • 2LP: Linear Programming and Logic Programming
    • V. Saraswat and P. V. Hentenryck Eds. Cambridge, Ma: The MIT Press
    • Mcaloon, K. and Tretkoff, C. 1995. 2LP: Linear Programming and Logic Programming. In V. Saraswat and P. V. Hentenryck Eds., Principles and Practice of Constraint Programming. Cambridge, Ma: The MIT Press.
    • (1995) Principles and Practice of Constraint Programming.
    • Mcaloon, K.1    Tretkoff, C.2
  • 22
    • 0004280650 scopus 로고
    • A C++ Implementation of CLP
    • (Singapore, November 1994)
    • Puget, J.-F. 1994. A C++ Implementation of CLP. In Proceedings of SPICIS'94 (Singapore, November 1994).
    • (1994) Proceedings of SPICIS'94
    • Puget, J.-F.1
  • 25
    • 0000278641 scopus 로고
    • Preprocessing and Probing for Mixed Integer Programming Problems
    • Savelbergh, M. 1994. Preprocessing and Probing for Mixed Integer Programming Problems. ORSA Journal of Computing 6, 445-454.
    • (1994) ORSA Journal of Computing , vol.6 , pp. 445-454
    • Savelbergh, M.1
  • 28
    • 77952726925 scopus 로고
    • The Oz Programming Model
    • J. VAN LEEUWEN Ed. LNCS, No. 1000, Springer Verlag
    • Smolka, G. 1995. The Oz Programming Model. In J. VAN LEEUWEN Ed., Computer Science Today. LNCS, No. 1000, Springer Verlag.
    • (1995) Computer Science Today.
    • Smolka, G.1
  • 32
    • 84958090482 scopus 로고
    • The Cardinality Operator: A New Logical Connective and its Application to Constraint Logic Programming
    • (Paris (France), June 1991)
    • Van Hentenryck, P. and Deville, Y. 1991. The Cardinality Operator: A New Logical Connective and its Application to Constraint Logic Programming. In Eighth International Conference on Logic Programming (ICLP-91) (Paris (France), June 1991).
    • (1991) Eighth International Conference on Logic Programming (ICLP-91)
    • Van Hentenryck, P.1    Deville, Y.2


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