A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems

References

Page 1

	Year	Citations
Optimization by Simulated Annealing Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi Science Numerical AnalysisLarge-scale Global OptimizationComputational ScienceStatistical MechanicsEngineering	1983	44K
Tabu Search—Part II Fred Glover INFORMS Journal on Computing Search OptimizationArtificial IntelligenceMathematical ProgrammingTabu Search—part IiEngineering	1990	5.6K
Tabu Search—Part I Fred Glover INFORMS Journal on Computing Search OptimizationArtificial IntelligenceEngineeringTabu Search MethodsComputational Complexity	1989	4.9K
Linear and nonlinear programming. Mathematics and Computers in Simulation Mathematical ProgrammingEngineeringLinear OptimizationNonlinear ProgrammingLinear Programming	1986	4.8K
A Machine-Oriented Logic Based on the Resolution Principle John A. Robinson Journal of the ACM Applied LogicComputational LogicEngineeringData ScienceAutomated Reasoning	1965	3.9K
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm V. Černý Journal of Optimization Theory and Applications Mathematical ProgrammingEngineeringSimulated AnnealingTraveling Salesman ProblemCombinatorial Problem	1985	3.4K
A Computing Procedure for Quantification Theory Martin Davis, Hilary Putnam Journal of the ACM Computational Complexity TheoryEngineeringConstructive LogicMathematics CognitionComputational Complexity	1960	2.6K
A new method for solving hard satisfiability problems Bart Selman, Hector J. Levesque, David G. M. Mitchell	1992	1.2K
Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) Michael de la Maza ACM SIGART Bulletin	1993	1.1K
A probabilistic heuristic for a computationally difficult set covering problem Thomas A. Feo, Maurício G. C. Resende Operations Research Letters Covering ProblemsEngineeringHeuristic (Computer Science)Combinatory AnalysisCombinatorial Problem	1989	1K

Page 1