Dual Encoding Using Constraint Coverings
暂无分享,去创建一个
Abdul Sattar | Scott D. Goodwin | Sivakumar Nagarajan | S. Goodwin | A. Sattar | Sivakumar Nagarajan
[1] Toby Walsh,et al. Encodings of Non-Binary Constraint Satisfaction Problems , 1999, AAAI/IAAI.
[2] Peter van Beek,et al. On the conversion between non-binary constraint satisfaction problems , 1998, AAAI 1998.
[3] Wolfgang Bibel,et al. Constraint Satisfaction from a Deductive Viewpoint , 1988, Artif. Intell..
[4] Roger Mohr,et al. Good Old Discrete Relaxation , 1988, ECAI.
[5] Wanlin Pang,et al. Constraint-Directed Backtracking , 1997, Australian Joint Conference on Artificial Intelligence.
[6] Peter van Beek,et al. On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems , 1998, AAAI/IAAI.
[7] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[8] Abdul Sattar,et al. A Constraint Directed Model for Partial Constraint Satisfaction Problems , 2000, Canadian Conference on AI.
[9] Abdul Sattar,et al. On Dual Encodings for Non-binary Constraint Satisfaction Problems , 2000, CP.
[10] Christian Bessiere,et al. Using Inference to Reduce Arc Consistency Computation , 1995, IJCAI.
[11] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[12] Christian Bessiere,et al. Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..
[13] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..