暂无分享,去创建一个
Abdul Sattar | Kaile Su | Shaowei Cai | Chuan Luo | A. Sattar | Chuan Luo | Shaowei Cai | Kaile Su
[1] P. Pardalos,et al. An exact algorithm for the maximum clique problem , 1990 .
[2] Uriel Feige,et al. Approximating Maximum Clique by Removing Subgraphs , 2005, SIAM J. Discret. Math..
[3] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .
[4] Emile H. L. Aarts,et al. Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series) , 2007 .
[5] Diogo Vieira Andrade,et al. Fast local search for the maximum independent set problem , 2008, Journal of Heuristics.
[6] Michael Stuart,et al. Understanding Robust and Exploratory Data Analysis , 1984 .
[7] Panos M. Pardalos,et al. A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere , 2002, J. Comb. Optim..
[8] Roberto Battiti,et al. Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.
[9] Abdul Sattar,et al. Local search with edge weighting and configuration checking heuristics for minimum vertex cover , 2011, Artif. Intell..
[10] Wayne J. Pullan,et al. Phased local search for the maximum clique problem , 2006, J. Comb. Optim..
[11] Thomas Stützle,et al. Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT , 1999, Artif. Intell..
[12] Ehud Rivlin,et al. Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources , 2003, J. Artif. Intell. Res..
[13] Frederick Mosteller,et al. Understanding Robust and Exploratory Data Analysis. , 1983 .
[14] Charu C. Aggarwal,et al. Optimized Crossover for the Independent Set Problem , 1997, Oper. Res..
[15] Wei Li,et al. Many hard examples in exact phase transitions , 2003, Theor. Comput. Sci..
[16] George Karakostas,et al. A better approximation ratio for the vertex cover problem , 2005, TALG.
[17] Patric R. J. Östergård,et al. A fast algorithm for the maximum clique problem , 2002, Discret. Appl. Math..
[18] Jean-Paul Watson,et al. Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search , 2004, J. Artif. Intell. Res..
[19] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[20] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[21] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[22] C.H. Papadimitriou,et al. On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[23] Emile H. L. Aarts,et al. Theoretical aspects of local search , 2006, Monographs in Theoretical Computer Science. An EATCS Series.
[24] M. Trick,et al. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993 , 1996 .
[25] Zhe Wu,et al. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.
[26] Thomas Bartz-Beielstein,et al. Experimental Methods for the Analysis of Optimization Algorithms , 2010 .
[27] Kaile Su,et al. Configuration Checking with Aspiration in Local Search for SAT , 2012, AAAI.
[28] Thomas Stützle,et al. Iterated Robust Tabu Search for MAX-SAT , 2003, Canadian Conference on AI.
[29] Jean-Charles Régin,et al. Using Constraint Programming to Solve the Maximum Clique Problem , 2003, CP.
[30] Thomas Stützle,et al. Stochastic Local Search: Foundations & Applications , 2004 .
[31] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[32] Bertrand M. T. Lin,et al. An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem , 2004, Ann. Oper. Res..
[34] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[35] Abdul Sattar,et al. Two New Local Search Strategies for Minimum Vertex Cover , 2012, AAAI.
[36] Nobuhiro Yugami,et al. Improving Repair-Based Constraint Satisfaction Methods by Value Propagation , 1994, AAAI.
[37] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[38] Mauro Brunato,et al. Cooperating local search for the maximum clique problem , 2011, J. Heuristics.
[39] Sanjaya Gajurel,et al. A Fast Near Optimal Vertex Cover Algorithm (NOVCA) , 2012 .
[40] Fred W. Glover,et al. Multi-neighborhood tabu search for the maximum weight clique problem , 2012, Annals of Operations Research.
[41] John Thornton,et al. Additive versus Multiplicative Clause Weighting for SAT , 2004, AAAI.
[42] Kaile Su,et al. Local Search with Configuration Checking for SAT , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.
[43] Chu Min Li,et al. Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem , 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.
[44] Etsuji Tomita,et al. An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments , 2001, J. Glob. Optim..
[45] Wei Li,et al. Exact Phase Transitions in Random Constraint Satisfaction Problems , 2000, J. Artif. Intell. Res..
[46] Torsten Fahle,et al. Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique , 2002, ESA.
[47] Ke Xu,et al. A Simple Model to Generate Hard Satisfiable Instances , 2005, IJCAI.
[48] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[49] Wayne Pullan. Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers , 2009, Discret. Optim..
[50] Malte Helmert,et al. A Stochastic Local Search Approach to Vertex Cover , 2007, KI.
[51] Wayne J. Pullan,et al. Dynamic Local Search for the Maximum Clique Problem , 2011, J. Artif. Intell. Res..
[52] Felip Manyà,et al. New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..
[53] Chu Min Li,et al. An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem , 2010, AAAI 2010.
[54] Ke Xu,et al. Random constraint satisfaction: Easy generation of hard (satisfiable) instances , 2007, Artif. Intell..
[55] Kaile Su,et al. EWLS: A New Local Search for Minimum Vertex Cover , 2010, AAAI.
[56] Kengo Katayama,et al. Iterated k-Opt Local Search for the Maximum Clique Problem , 2007, EvoCOP.
[57] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[58] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[59] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[60] Abdul Sattar,et al. Neighbourhood Clause Weight Redistribution in Local Search for SAT , 2005, CP.
[61] Valmir Carneiro Barbosa,et al. A Novel Evolutionary Formulation of the Maximum Independent Set Problem , 2003, J. Comb. Optim..
[62] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[63] Wayne J. Pullan,et al. Simple ingredients leading to very efficient heuristics for the maximum clique problem , 2008, J. Heuristics.
[64] Isaac K. Evans,et al. Evolutionary Algorithms for Vertex Cover , 1998, Evolutionary Programming.
[65] Dale Schuurmans,et al. The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming , 2001, IJCAI.
[66] Éric D. Taillard,et al. Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..