Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems
暂无分享,去创建一个
[1] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[2] Dániel Marx,et al. Approximating fractional hypertree width , 2009, TALG.
[3] Chris Walshaw,et al. Multilevel Refinement for Combinatorial Optimisation Problems , 2004, Ann. Oper. Res..
[4] Michael R. Fellows,et al. Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..
[5] Eugene C. Freuder. A sufficient condition for backtrack-bounded search , 1985, JACM.
[6] Philippe Jégou,et al. Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems , 2008, 2008 20th IEEE International Conference on Tools with Artificial Intelligence.
[7] Rustem Takhanov,et al. A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem , 2007, STACS.
[8] Leo G. Kroon,et al. The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs , 1996, WG.
[9] Georg Gottlob,et al. Hypertree decompositions and tractable queries , 1998, PODS '99.
[10] Thomas Schiex,et al. Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.
[11] Georg Gottlob,et al. On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition , 2007, EC '07.
[12] Rina Dechter,et al. Tree Clustering for Constraint Networks , 1989, Artif. Intell..
[13] Eugene C. Freuder,et al. Partial Constraint Satisfaction , 1989, IJCAI.
[14] Michael R. Fellows,et al. FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .
[15] Georg Gottlob,et al. Tractable Optimization Problems through Hypergraph-Based Structural Restrictions , 2009, ICALP.
[16] Dániel Marx,et al. Size Bounds and Query Plans for Relational Joins , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[17] Gregory Gutin,et al. Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs , 2005, AAIM.
[18] Marc Gyssens,et al. A unified theory of structural tractability for constraint satisfaction problems , 2008, J. Comput. Syst. Sci..
[19] Marko Samer,et al. Constraint satisfaction with bounded treewidth revisited , 2010, J. Comput. Syst. Sci..
[20] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..
[21] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.
[22] Martin Grohe,et al. The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[23] Peter Jonsson,et al. Bounded Tree-Width and CSP-Related Problems , 2007, ISAAC.
[24] Kevin Leyton-Brown,et al. SATzilla2009: an Automatic Algorithm Portfolio for SAT , 2008 .
[25] Martin Grohe,et al. Constraint solving via fractional edge covers , 2006, SODA 2006.
[26] Hubie Chen,et al. Constraint satisfaction with succinctly specified relations , 2010, J. Comput. Syst. Sci..
[27] Simon de Givry,et al. Exploiting Tree Decomposition and Soft Local Consistency In Weighted CSP , 2006, AAAI.
[28] Ronald Fagin,et al. Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.
[29] Dániel Marx. Tractable Structures for Constraint Satisfaction with Truth Tables , 2009, STACS.
[30] Bruce A. Reed,et al. Finding approximate separators and computing tree width quickly , 1992, STOC '92.
[31] Philippe Jégou,et al. Bounded Backtracking for the Valued Constraint Satisfaction Problems , 2003, CP.
[32] Catriel Beeri,et al. On the Desirability of Acyclic Database Schemes , 1983, JACM.
[33] Fan Chung Graham,et al. Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.