메뉴 건너뛰기




Volumn 3011, Issue , 2004, Pages 65-79

Filtering algorithms for the same constraint

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

EID: 35048882462     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24664-0_5     Document Type: Article
Times cited : (19)

References (8)
  • 2
    • 0020732246 scopus 로고
    • A Linear-Time Algorithm for a Special Case of Disjoint Set Union
    • H. N. Gabow and R. E. Tarjan. A Linear-Time Algorithm for a Special Case of Disjoint Set Union. Journal of Computer and System Sciences, 30(2):209-221, 1985.
    • (1985) Journal of Computer and System Sciences , vol.30 , Issue.2 , pp. 209-221
    • Gabow, H.N.1    Tarjan, R.E.2
  • 4
    • 35248897062 scopus 로고    scopus 로고
    • Fast bound consistency for the global cardinality constraint
    • Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP 2003)
    • I. Katriel and S. Thiel. Fast bound consistency for the global cardinality constraint. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), volume 2833 of LNCS, pages 437-451, 2003.
    • (2003) LNCS , vol.2833 , pp. 437-451
    • Katriel, I.1    Thiel, S.2
  • 5
    • 84945942908 scopus 로고    scopus 로고
    • Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
    • Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP 2000)
    • K. Mehlhom and S. Thiel. Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint. In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP 2000), volume 1894 of LNCS, pages 306-319, 2000.
    • (2000) LNCS , vol.1894 , pp. 306-319
    • Mehlhom, K.1    Thiel, S.2


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