메뉴 건너뛰기




Volumn 94, Issue 3, 2005, Pages 99-105

On the system of two all_different predicates

Author keywords

all_different predicate; Combinatorial problems; Constraint logic programming; Facet

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FUNCTIONS; GRAPH THEORY; INTEGER PROGRAMMING; LINEAR EQUATIONS; LINEAR PROGRAMMING; LOGIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; VECTORS;

EID: 15344351525     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.01.009     Document Type: Article
Times cited : (14)

References (8)
  • 1
    • 0002937243 scopus 로고    scopus 로고
    • Properties of some combinatorial optimization problems and their effect in the performance of integer programming and constraint logic programming
    • K. Darby-Dowman, and J. Little Properties of some combinatorial optimization problems and their effect in the performance of integer programming and constraint logic programming INFORMS J. Comput. 10 1998 276 286
    • (1998) INFORMS J. Comput. , vol.10 , pp. 276-286
    • Darby-Dowman, K.1    Little, J.2
  • 4
    • 15344342136 scopus 로고    scopus 로고
    • Private communication, ILOG S.A.
    • C. Le Pape, Private communication, ILOG S.A., 2004
    • (2004)
    • Le Pape, C.1
  • 5
    • 0001019929 scopus 로고
    • Polyhedral combinatorics
    • G.L. Nemhauser A.H.G. Rinnooy Kan M.J. Todd North-Holland Amsterdam
    • W.R. Pulleyblank Polyhedral combinatorics G.L. Nemhauser A.H.G. Rinnooy Kan M.J. Todd Optimization 1989 North-Holland Amsterdam 371 446
    • (1989) Optimization , pp. 371-446
    • Pulleyblank, W.R.1
  • 6
    • 0008868340 scopus 로고    scopus 로고
    • Tight representation of logic constraints as cardinality rules
    • H. Yan, and J.N. Hooker Tight representation of logic constraints as cardinality rules Math. Program. 85 1999 363 377
    • (1999) Math. Program. , vol.85 , pp. 363-377
    • Yan, H.1    Hooker, J.N.2
  • 7
    • 84957026851 scopus 로고    scopus 로고
    • On the sum constraint: Relaxation and applications
    • P. van Hentenryck, Principles and Practice of Constraint Programming - CP2002, Springer Berlin
    • T.H. Yunes On the sum constraint: relaxation and applications P. van Hentenryck Principles and Practice of Constraint Programming - CP2002 Lecture Notes in Comput. Sci. vol. 2470 2002 Springer Berlin 80 92
    • (2002) Lecture Notes in Comput. Sci. , vol.2470 , pp. 80-92
    • Yunes, T.H.1
  • 8
    • 0141557700 scopus 로고    scopus 로고
    • Representations of the all_different predicate of constraint satisfaction in integer programming
    • H.P. Williams, and H. Yan Representations of the all_different predicate of constraint satisfaction in integer programming INFORMS J. Comput. 13 2001 96 103
    • (2001) INFORMS J. Comput. , vol.13 , pp. 96-103
    • Williams, H.P.1    Yan, H.2


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