Soft arc consistency revisited
暂无分享,去创建一个
Martin C. Cooper | Simon de Givry | Thomas Schiex | Martí Sánchez-Fibla | Matthias Zytnicki | Tomás Werner | S. D. Givry | M. Zytnicki | Tomáš Werner | T. Schiex | M. Sánchez-Fibla | Martí Sánchez-Fibla
[1] Martin C. Cooper,et al. The complexity of soft constraint satisfaction , 2006, Artif. Intell..
[2] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[3] Rina Dechter,et al. Principles and Practice of Constraint Programming – CP 2000 , 2001, Lecture Notes in Computer Science.
[4] Christian Bessiere,et al. Arc-Consistency in Dynamic Constraint Satisfaction Problems , 1991, AAAI.
[6] Hachemi Bennaceur,et al. A Weighted Arc Consistency Technique for MAX-CSP , 1998, ECAI.
[7] S. Fujishige,et al. The Minimum-Norm-Point Algorithm Applied to Submodular Function Minimization and Linear Programming , 2006 .
[8] Martin C. Cooper,et al. A weighted CSP approach to cost-optimal planning , 2009, AI Commun..
[9] Arie M. C. A. Koster,et al. Solving Frequency Assignment Problems via Tree-Decomposition1 , 1999, Electron. Notes Discret. Math..
[10] Simon de Givry,et al. Radio Link Frequency Assignment , 1999, Constraints.
[11] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..
[12] Satoru Fujishige,et al. NEW MAXIMUM FLOW ALGORITHMS BY MA ORDERMGS AND SCALING , 2003 .
[13] James B. Orlin,et al. A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization , 2007, IPCO.
[14] Dmitrij Schlesinger,et al. Exact Solution of Permuted Submodular MinSum Problems , 2007, EMMCVPR.
[15] Thomas Schiex,et al. On the Complexity of Compact Coalitional Games , 2009, IJCAI.
[16] Arie M. C. A. Koster,et al. The partial constraint satisfaction problem: Facets and lifting theorems , 1998, Oper. Res. Lett..
[17] Simon de Givry,et al. Exploiting Tree Decomposition and Soft Local Consistency In Weighted CSP , 2006, AAAI.
[18] Satoru Fujishige,et al. Realization of set functions as cut functions of graphs and hypergraphs , 2001, Discret. Math..
[19] Christian Bessiere,et al. Refining the Basic Constraint Propagation Algorithm , 2001, JFPLC.
[20] Paul W. H. Chung,et al. Developments in Applied Artificial Intelligence , 2003, Lecture Notes in Computer Science.
[21] Simon de Givry,et al. Russian Doll Search with Tree Decomposition , 2009, IJCAI.
[22] Martin C. Cooper. Cyclic consistency: A local reduction operation for binary valued constraints , 2004, Artif. Intell..
[23] Martin C. Cooper. Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency , 2007, Constraints.
[24] Martin C. Cooper. High-Order Consistency in Valued Constraint Satisfaction , 2005, Constraints.
[25] Simon de Givry,et al. Bounds Arc Consistency for Weighted CSPs , 2009, J. Artif. Intell. Res..
[26] James B. Orlin,et al. A faster strongly polynomial time algorithm for submodular function minimization , 2007, Math. Program..
[27] Arie M. C. A. Koster,et al. Frequency assignment : models and algorithms , 1999 .
[28] Thomas Schiex,et al. Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.
[29] Arie M. C. A. Koster,et al. Solving frequency assignment problems via tree-decomposition , 1999 .
[30] Martin C. Cooper,et al. A Maximal Tractable Class of Soft Constraints , 2003, IJCAI.
[31] Panos M. Pardalos,et al. Feedback Set Problems , 1999, Handbook of Combinatorial Optimization.
[32] Martin J. Wainwright,et al. MAP estimation via agreement on trees: message-passing and linear programming , 2005, IEEE Transactions on Information Theory.
[33] Martin C. Cooper,et al. Tractable Constraints on Ordered Domains , 1995, Artif. Intell..
[34] Albert Oliveras,et al. MiniMaxSat: A New Weighted Max-SAT Solver , 2007, SAT.
[35] Simon de Givry,et al. Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques , 2007, Constraints.
[36] Michel X. Goemans,et al. Minimum Cuts , 2010, Encyclopedia of Machine Learning.
[37] Krzysztof R. Apt,et al. The Essence of Constraint Propagation , 1998, Theor. Comput. Sci..
[38] Vladimir Kolmogorov,et al. Convergent Tree-Reweighted Message Passing for Energy Minimization , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[39] Felip Manyà,et al. Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.
[40] William H. Cunningham,et al. Minimum cuts, modular functions, and matroid polyhedra , 1985, Networks.
[41] Hachemi Bennaceur,et al. Computing Lower Bound for MAX-CSP Problems , 2003, IEA/AIE.
[42] Pierre Hansen,et al. Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..
[43] Donald Goldfarb,et al. A computational comparison of the dinic and network simplex methods for maximum flow , 1988 .
[44] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.
[45] Jozef Kratica,et al. Solving the simple plant location problem by genetic algorithm , 2001, RAIRO Oper. Res..
[46] Martin J. Wainwright,et al. MAP estimation via agreement on (hyper)trees: Message-passing and linear programming , 2005, ArXiv.
[47] Martin C. Cooper. Reduction operations in fuzzy or valued constraint satisfaction , 2003, Fuzzy Sets Syst..
[48] Javier Larrosa,et al. Boosting Search with Variable Elimination , 2000, CP.
[49] Roger Mohr,et al. Good Old Discrete Relaxation , 1988, ECAI.
[50] Simon de Givry,et al. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.
[51] Francesca Rossi,et al. Temporal Constraint Reasoning With Preferences , 2001, IJCAI.
[52] Martin C. Cooper,et al. Optimal Soft Arc Consistency , 2007, IJCAI.
[53] Lakhdar Sais,et al. Reasoning from last conflict(s) in constraint programming , 2009, Artif. Intell..
[54] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[55] P. Pardalos,et al. Handbook of Combinatorial Optimization , 1998 .
[56] Tomás Werner,et al. A Linear Programming Approach to Max-Sum Problem: A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[57] Christian Bessiere,et al. New Lower Bounds of Constraint Violations for Over-Constrained Problems , 2001, CP.
[58] Martin C. Cooper,et al. Hybrid tractable CSPs which generalize tree structure , 2008, ECAI.