Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming
暂无分享,去创建一个
[1] Narendra Jussien,et al. Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..
[2] Lakhdar Sais,et al. Boosting Systematic Search by Weighting Constraints , 2004, ECAI.
[3] J. Hooker,et al. Logic-based Benders decomposition , 2003 .
[4] Toby Walsh,et al. Singleton Consistencies , 2000, CP.
[5] Patrick Prosser,et al. MAC-CBJ: maintaining arc consistency with conflict-directed backjumping , 1995 .
[6] Narendra Jussien,et al. The versatility of using explanations within constraint programming , 2003 .
[7] Christian Bessiere,et al. MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.
[8] Patrice Boizumault,et al. Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.
[9] Hadrien Cambazard,et al. Integrating Benders Decomposition Within Constraint Programming , 2005, CP.
[10] Rémi Monasson,et al. Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.
[11] Narendra Jussien,et al. The PaLM system: explanation-based constraint programming , 2000 .
[12] Vipul Jain,et al. Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..
[13] Philippe Refalo,et al. Impact-Based Search Strategies for Constraint Programming , 2004, CP.
[14] Simon de Givry,et al. Radio Link Frequency Assignment , 1999, Constraints.
[15] Jean-Charles Régin,et al. A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.
[16] Bart Selman,et al. Backdoors To Typical Case Complexity , 2003, IJCAI.
[17] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..
[18] Hadrien Cambazard,et al. Decomposition and Learning for a Hard Real Time Task Allocation Problem , 2004, CP.
[19] J. F. Benders. Partitioning procedures for solving mixed-variables programming problems , 1962 .
[20] Yannis C. Stamatiou,et al. Random Constraint Satisfaction: A More Accurate Picture , 1997, CP.
[21] Jean-Daniel Fekete,et al. VISEXP: Visualizing Constraint Solver Dynamics Using Explanations , 2004, FLAIRS.
[22] Bart Selman,et al. On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search , 2003 .
[23] Lakhdar Sais,et al. Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem , 2001, CP.
[24] Bart Selman,et al. Heavy-Tailed Distributions in Combinatorial Search , 1997, CP.
[25] A. M. Geoffrion. Generalized Benders decomposition , 1972 .
[26] Guillaume Cleuziou,et al. Disjunctive Learning with a Soft-Clustering Method , 2003, ILP.