메뉴 건너뛰기




Volumn 16, Issue 1, 2001, Pages 1-4

On the intersection of AI and OR

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MARKOV PROCESSES; OPERATIONS RESEARCH; OPTIMIZATION; PLANNING; SCHEDULING;

EID: 0346906733     PISSN: 02698889     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269888901000066     Document Type: Article
Times cited : (3)

References (11)
  • 1
  • 2
    • 0008644216 scopus 로고    scopus 로고
    • Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
    • De Fanas, I, Johnson, E and Nemhauser, G, 2001, "Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables" Knowledge Engineering Review 16(2) 25-39.
    • (2001) Knowledge Engineering Review , vol.16 , Issue.2 , pp. 25-39
    • De Fanas, I.1    Johnson, E.2    Nemhauser, G.3
  • 3
    • 0034155463 scopus 로고    scopus 로고
    • Combining satisfiability techniques from AI and OR
    • Dixon, H and Ginsberg, M, 2000, "Combining satisfiability techniques from AI and OR" Knowledge Engineering Review 15(1) 31-47.
    • (2000) Knowledge Engineering Review , vol.15 , Issue.1 , pp. 31-47
    • Dixon, H.1    Ginsberg, M.2
  • 4
    • 0034155462 scopus 로고    scopus 로고
    • Artificial intelligence and operations research: Challenges and opportunities in planning and scheduling
    • Gomes, C, 2000, "Artificial intelligence and operations research: challenges and opportunities in planning and scheduling" Knowledge Engineering Review 15(1) 1-11.
    • (2000) Knowledge Engineering Review , vol.15 , Issue.1 , pp. 1-11
    • Gomes, C.1
  • 5
  • 6
    • 0034155759 scopus 로고    scopus 로고
    • Integer optimisation models of AI planning problems
    • Kautz, H and Walser, J, 2000, "Integer optimisation models of AI planning problems" Knowledge Engineering Review 15(1) 101-117.
    • (2000) Knowledge Engineering Review , vol.15 , Issue.1 , pp. 101-117
    • Kautz, H.1    Walser, J.2
  • 7
    • 0346906732 scopus 로고    scopus 로고
    • Constraint programming and maths programming
    • Puget, J and Lustig, I, 2001, "Constraint programming and maths programming" Knowledge Engineering Review 16(2) 5-23.
    • (2001) Knowledge Engineering Review , vol.16 , Issue.2 , pp. 5-23
    • Puget, J.1    Lustig, I.2
  • 8
    • 0034155410 scopus 로고    scopus 로고
    • Bridging the gap between planning and scheduling
    • Smith, D, Frank, J and Jonsson A, 2000, "Bridging the gap between planning and scheduling" Knowledge Engineering Review 15(1) 47-85.
    • (2000) Knowledge Engineering Review , vol.15 , Issue.1 , pp. 47-85
    • Smith, D.1    Frank, J.2    Jonsson, A.3
  • 9
    • 0346276481 scopus 로고    scopus 로고
    • Synthesis of efficient constraint-satisfaction programs
    • Westfold, S and Smith, D, 2001, "Synthesis of efficient constraint-satisfaction programs" Knowledge Engineering Review 16(2) 69-84.
    • (2001) Knowledge Engineering Review , vol.16 , Issue.2 , pp. 69-84
    • Westfold, S.1    Smith, D.2
  • 10
    • 0348167249 scopus 로고    scopus 로고
    • Combining linear programming and satisfiability-solving for resource planning
    • Wolfman, S and Weld, D, 2001, "Combining linear programming and satisfiability-solving for resource planning" Knowledge Engineering Review 16(2) 85-99.
    • (2001) Knowledge Engineering Review , vol.16 , Issue.2 , pp. 85-99
    • Wolfman, S.1    Weld, D.2
  • 11
    • 0034156240 scopus 로고    scopus 로고
    • Applying integer-programming techniques to AI planning
    • Vossen, T, Ball, M, Lotem, A and Nau, D, 2000, "Applying integer-programming techniques to AI planning" Knowledge Engineering Review 15(1) 85-101.
    • (2000) Knowledge Engineering Review , vol.15 , Issue.1 , pp. 85-101
    • Vossen, T.1    Ball, M.2    Lotem, A.3    Nau, D.4


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