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