GRASP with path relinking for the weighted MAXSAT problem
From MaRDI portal
Publication:3507771
DOI10.1145/1187436.1216581zbMath1140.68403OpenAlexW1987869562MaRDI QIDQ3507771
Leonidas S. Pitsoulis, Panos M. Pardalos, Mauricio G. C. Resende, Paola Festa
Publication date: 20 June 2008
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1187436.1216581
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Community detection by modularity maximization using GRASP with path relinking, A nonmonotone GRASP, The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, Solving the weighted MAX-SAT problem using the dynamic convexized method, Extending time‐to‐target plots to multiple instances, An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem, Restart strategies for GRASP with path-relinking heuristics, The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications, Solving weighted MAX-SAT via global equilibrium search, Hybridizations of GRASP with path relinking for the far from most string problem, Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions, Hybrid algorithms for placement of virtual machines across geo-separated data centers
