메뉴 건너뛰기




Volumn 1, Issue , 1999, Pages 1-13

Solving TSP through the integration of OR and CP techniques

Author keywords

[No Author keywords available]

Indexed keywords


EID: 53149083745     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (14)

References (23)
  • 1
    • 0003222248 scopus 로고
    • Efficient operations research algorithms in constraint-based scheduling
    • P. Baptiste, C. Le Pape, and W. Nuijten. Efficient operations research algorithms in constraint-based scheduling. In Proceedings of IJCAI'95, 1995.
    • (1995) Proceedings of IJCAI'95
    • Baptiste, P.1    Le Pape, C.2    Nuijten, W.3
  • 3
    • 0000362676 scopus 로고
    • Combinatorial problem solving in constraint logic programming with cooperating solvers
    • C. Beierle and L. Plumer, editors, North Holland
    • H. Beringer and B. De Backer. Combinatorial problem solving in constraint logic programming with cooperating solvers. In C. Beierle and L. Plumer, editors, Logic Programming: formal Methods and Practical Applications. North Holland, 1995.
    • (1995) Logic Programming: Formal Methods and Practical Applications
    • Beringer, H.1    De Backer, B.2
  • 4
    • 0031676770 scopus 로고    scopus 로고
    • Integrating constraint logic programming and operations research techniques for the crew rostering problem
    • A. Caprara, F. Focacci, E. Lamma, P. Mello, M. Milano, P. Toth, and D. Vigo. Integrating constraint logic programming and operations research techniques for the crew rostering problem. Software Practice & Experience, 28(1):49-76, 1998.
    • (1998) Software Practice & Experience , vol.28 , Issue.1 , pp. 49-76
    • Caprara, A.1    Focacci, F.2    Lamma, E.3    Mello, P.4    Milano, M.5    Toth, P.6    Vigo, D.7
  • 5
    • 0000165767 scopus 로고
    • An algorithm for solving job shop scheduling
    • J. Carlier and E. Pinson. An algorithm for solving job shop scheduling. Management Science, 35:164-176, 1995.
    • (1995) Management Science , vol.35 , pp. 164-176
    • Carlier, J.1    Pinson, E.2
  • 8
    • 0002624862 scopus 로고    scopus 로고
    • Solving various weighted matching problems with constraints
    • Y. Caseau and F. Laburthe. Solving various weighted matching problems with constraints. In Proceedings of CP'97, 1997.
    • (1997) Proceedings of CP'97
    • Caseau, Y.1    Laburthe, F.2
  • 13
    • 0026705963 scopus 로고
    • An additive bounding procedure for the asymmetric travelling salesman problem
    • M. Fischetti and P. Toth. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming, 53:173-197, 1992.
    • (1992) Mathematical Programming , vol.53 , pp. 173-197
    • Fischetti, M.1    Toth, P.2
  • 14
    • 0005422920 scopus 로고
    • An efficient algorithm for the min-sum arborescence problem on complete digraphs
    • M. Fischetti and P. Toth. An efficient algorithm for the min-sum arborescence problem on complete digraphs. ORSA Journal of Computing, 5(4):426-434, 1993.
    • (1993) ORSA Journal of Computing , vol.5 , Issue.4 , pp. 426-434
    • Fischetti, M.1    Toth, P.2
  • 15
    • 0031271921 scopus 로고    scopus 로고
    • A polyhedral approach to the asymmetric travelling salesman problem
    • M. Fischetti and P. Toth. A polyhedral approach to the asymmetric travelling salesman problem. Management Science, 43(11):1520-1536, 1997.
    • (1997) Management Science , vol.43 , Issue.11 , pp. 1520-1536
    • Fischetti, M.1    Toth, P.2
  • 20
    • 0032000244 scopus 로고    scopus 로고
    • An exact constraint logic programming algorithm for the travelling salesman problem with time windows
    • G. Pesant, M. Gendreau, J.Y. Potvin, and J.M. Rousseau. An exact constraint logic programming algorithm for the travelling salesman problem with time windows. Transportation Science, 32(1):12-29, 1998.
    • (1998) Transportation Science , vol.32 , Issue.1 , pp. 12-29
    • Pesant, G.1    Gendreau, M.2    Potvin, J.Y.3    Rousseau, J.M.4
  • 22
    • 0028567611 scopus 로고
    • A filtering algorithm for constraints of difference in CSPs
    • J.C. Régin. A filtering algorithm for constraints of difference in CSPs. In Proceedings of AAAI'94, 1994.
    • (1994) Proceedings of AAAI'94
    • Régin, J.C.1
  • 23
    • 20944434441 scopus 로고    scopus 로고
    • A new approach to integrating mixed integer programming and constraint logic programming
    • R. Rodosek, M. Wallace, and M.T. Hajian. A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operational Research, 1997.
    • (1997) Annals of Operational Research
    • Rodosek, R.1    Wallace, M.2    Hajian, M.T.3


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