메뉴 건너뛰기




Volumn 3258, Issue , 2004, Pages 305-316

A hybrid method for planning and scheduling

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; PROBLEM SOLVING; SCHEDULING;

EID: 33646195257     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_24     Document Type: Article
Times cited : (47)

References (10)
  • 1
    • 9644308639 scopus 로고
    • Partitioning procedures for solving mixed-variables programming problems
    • Benders, J. F., Partitioning procedures for solving mixed-variables programming problems, Numerische Mathematik 4 (1962): 238-252.
    • (1962) Numerische Mathematik , vol.4 , pp. 238-252
    • Benders, J.F.1
  • 2
    • 84947913581 scopus 로고    scopus 로고
    • Hybrid Benders decomposition algorithms in constraint logic programming
    • T. Walsh, ed., Principles and Practice of Constraint Programming (CP 2001), Springer
    • Eremin, A., and M. Wallace, Hybrid Benders decomposition algorithms in constraint logic programming, in T. Walsh, ed., Principles and Practice of Constraint Programming (CP 2001), Lecture Notes in Computer Science 2239, Springer (2001).
    • (2001) Lecture Notes in Computer Science , vol.2239
    • Eremin, A.1    Wallace, M.2
  • 6
    • 0009704352 scopus 로고
    • Logic circuit verification by Benders decomposition
    • V. Saraswat and P. Van Hentenryck, eds., MIT Press Cambridge, MA
    • Hooker, J. N., and Hong Yan, Logic circuit verification by Benders decomposition, in V. Saraswat and P. Van Hentenryck, eds., Principles and Practice of Constraint Programming: The Newport Papers, MIT Press (Cambridge, MA, 1995) 267-288.
    • (1995) Principles and Practice of Constraint Programming: The Newport Papers , pp. 267-288
    • Hooker, J.N.1    Yan, H.2
  • 7
    • 0010986664 scopus 로고    scopus 로고
    • Algorithms for hybrid MILP/CP models for a class of optimization problems
    • Jain, V., and I. E. Grossmann, Algorithms for hybrid MILP/CP models for a class of optimization problems, INFORMS Journal on Computing 13 (2001) 258-276.
    • (2001) INFORMS Journal on Computing , vol.13 , pp. 258-276
    • Jain, V.1    Grossmann, I.E.2
  • 8
    • 84879208352 scopus 로고    scopus 로고
    • Branch-and-Check: A hybrid framework integrating mixed integer programming and constraint logic programming
    • Thorsteinsson, E. S., Branch-and-Check: A hybrid framework integrating mixed integer programming and constraint logic programming, Lecture Notes in Computer Science 2239 (2001) 16-30.
    • (2001) Lecture Notes in Computer Science , vol.2239 , pp. 16-30
    • Thorsteinsson, E.S.1
  • 9
    • 0030217802 scopus 로고    scopus 로고
    • Logic-based MINLP algorithms for the optimal synthesis of process networks
    • Türkay, M., and I. E. Grossmann, Logic-based MINLP algorithms for the optimal synthesis of process networks, Computers and Chemical Engineering 20 (1996) 959-978.
    • (1996) Computers and Chemical Engineering , vol.20 , pp. 959-978
    • Türkay, M.1    Grossmann, I.E.2
  • 10
    • 0030174820 scopus 로고    scopus 로고
    • The optimal operation of mixed production facilities
    • Zhang, X., and R. W. H. Sargent, The optimal operation of mixed production facilities, Computers and Chemical Engineering (1996) 20 897-904.
    • (1996) Computers and Chemical Engineering , vol.20 , pp. 897-904
    • Zhang, X.1    Sargent, R.W.H.2


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