GRASP with path relinking for the weighted MAXSAT problem

DOI10.1145/1187436.1216581MaRDI QIDQ3507771zbMATH OpenOpenAlexFDO

Authors Leonidas Pitsoulis, Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende

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

zbMATH Keywords

reedy Randomized Adaptive Search Procedure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40)

Recommendations

• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 1114001
• scientific article; zbMATH DE number 956862
• Solving the weighted MAX-SAT problem using the dynamic convexized method
• A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem

Cited in

(20)

• Solving weighted MAX-SAT via global equilibrium search
• An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
• The analysis of expected fitness and success ratio of two heuristic optimizations on two bimodal MaxSat problems
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
• Hybrid algorithms for placement of virtual machines across geo-separated data centers
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
• Solving the weighted MAX-SAT problem using the dynamic convexized method
• A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem
• Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
• Hybridizations of GRASP with path relinking for the far from most string problem
• Satisfiability by Maxwell-Boltzmann and Bose-Einstein statistical distributions
• GRASP with path relinking for three-index assignment
• A GRASP metaheuristic for microarray data analysis
• Community detection by modularity maximization using GRASP with path relinking
• A nonmonotone GRASP
• scientific article; zbMATH DE number 1114001 (Why is no real title available?)
• Extending time-to-target plots to multiple instances
• Experimental and Efficient Algorithms
• Greedy randomized adaptive search procedures with path relinking. An analytical review of designs and implementations
• Restart strategies for GRASP with path-relinking heuristics

This page was built for publication: GRASP with path relinking for the weighted MAXSAT problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507771)