An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
暂无分享,去创建一个
[1] Rajeev Motwani,et al. On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[2] Matthias Poloczek. Bounds on Greedy Algorithms for MAX SAT , 2011, ESA.
[3] Torsten Schaub,et al. Unsatisfiability-based optimization in clasp , 2012, ICLP.
[4] Martin Gebser,et al. Reactive Answer Set Programming , 2011, LPNMR.
[5] Kaile Su,et al. Tailoring Local Search for Partial MaxSAT , 2014, AAAI.
[6] Joao Marques-Silva,et al. Iterative and core-guided MaxSAT solving: A survey and assessment , 2013, Constraints.
[7] Martin Gebser,et al. Multi-Criteria Optimization in Answer Set Programming , 2011, ICLP.
[8] Allan Borodin,et al. On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem , 2010, SAT.
[9] Martin Gebser,et al. Progress in clasp Series 3 , 2015, LPNMR.
[10] Ya Zhang,et al. Protein Interaction Inference as a MAX-SAT Problem , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops.
[11] Djamal Habet,et al. Ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver , 2015, J. Satisf. Boolean Model. Comput..
[12] Jianer Chen,et al. Tight Bound on Johnson's Algorithm for Maximum Satisfiability , 1999, J. Comput. Syst. Sci..
[13] David S. Johnson,et al. The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .
[14] Asaf Shapira,et al. Randomized greedy: new variants of some classic approximation algorithms , 2011, SODA '11.
[15] Matthias Poloczek,et al. Randomized variants of Johnson's algorithm for MAX SAT , 2011, SODA '11.
[16] Matthias Poloczek,et al. Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds , 2017, SIAM J. Comput..
[17] Shang-Hua Teng,et al. Smoothed analysis: an attempt to explain the behavior of algorithms in practice , 2009, CACM.
[18] Matthias Poloczek,et al. On Some Recent Approximation Algorithms for MAX SAT , 2014, LATIN.
[19] Vasco M. Manquinho,et al. Incremental Cardinality Constraints for MaxSAT , 2014, CP.
[20] Anke van Zuylen. Simpler 3/4-Approximation Algorithms for MAX SAT , 2011, WAOA.
[21] Nina Narodytska,et al. Maximum Satisfiability Using Core-Guided MaxSAT Resolution , 2014, AAAI.
[22] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.
[23] Vasco M. Manquinho,et al. Open-WBO: A Modular MaxSAT Solver, , 2014, SAT.
[24] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[25] Luca Maria Gambardella,et al. MAX-2-SAT: How Good Is Tabu Search in the Worst-Case? , 2004, AAAI.
[26] William M. Spears,et al. Simulated annealing for hard satisfiability problems , 1993, Cliques, Coloring, and Satisfiability.
[27] Jun Gu,et al. Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.
[28] Yahiko Kambayashi,et al. Database Queries as Combinatorial Optimization Problems , 1996, CODAS.