Article

A Parallel GRASP for MAX-SAT Problems

Authors:

Mauricio G. C. ResendeAuthors Info & Claims

PARA '96: Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization

Pages 575 - 585

Published: 18 August 1996 Publication History

Abstract

No abstract available.

Cited By

View all

Avdil AWeihe K(2010)Local search starting from an LP solutionACM Journal of Experimental Algorithmics10.1145/1498698.159487714(1.6-1.31)Online publication date: 5-Jan-2010
https://dl.acm.org/doi/10.1145/1498698.1594877
Borschbach MExeler A(2008)A search agent for a Max-2sat memetic algorithm approachProceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science10.5555/1415743.1415791(284-289)Online publication date: 6-Apr-2008
https://dl.acm.org/doi/10.5555/1415743.1415791
Boughaci DDrias H(2005)Efficient and experimental meta-heuristics for MAX-SAT problemsProceedings of the 4th international conference on Experimental and Efficient Algorithms10.1007/11427186_43(501-512)Online publication date: 10-May-2005
https://dl.acm.org/doi/10.1007/11427186_43
Show More Cited By

A Parallel GRASP for MAX-SAT Problems
1. Computing methodologies
  1. Parallel computing methodologies
2. Theory of computation
  1. Design and analysis of algorithms
  2. Models of computation
    1. Concurrency

Recommendations

Efficient and experimental meta-heuristics for MAX-SAT problems
WEA'05: Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Many problems in combinatorial optimization are NP-Hard. This has forced researchers to explore meta-heuristic techniques for dealing with this class of complex problems and finding an acceptable solution in reasonable time. The satisfiability problem, ...
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems

In this paper, we show how Guided Local Search (GLS) can be applied to the SAT problem and show how the resulting algorithm can be naturally extended to solve the weighted MAX-SAT problem. GLS is a general, penalty-based meta-heuristic, which sits on ...
Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic
SAC '04: Proceedings of the 2004 ACM symposium on Applied computing

In the last three decades, many researchers have focused on the Satisfiability problem and on many of its variants, in particular, on the Weighted Maximum Satisfiability problem (Max-W-Sat). The latter is known to be difficult to solve, due to a high ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PARA '96: Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization

August 1996

718 pages

ISBN:3540620958

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 18 August 1996

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Avdil AWeihe K(2010)Local search starting from an LP solutionACM Journal of Experimental Algorithmics10.1145/1498698.159487714(1.6-1.31)Online publication date: 5-Jan-2010
https://dl.acm.org/doi/10.1145/1498698.1594877
Borschbach MExeler A(2008)A search agent for a Max-2sat memetic algorithm approachProceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science10.5555/1415743.1415791(284-289)Online publication date: 6-Apr-2008
https://dl.acm.org/doi/10.5555/1415743.1415791
Boughaci DDrias H(2005)Efficient and experimental meta-heuristics for MAX-SAT problemsProceedings of the 4th international conference on Experimental and Efficient Algorithms10.1007/11427186_43(501-512)Online publication date: 10-May-2005
https://dl.acm.org/doi/10.1007/11427186_43
Boughaci DDrias HHaddad HOmicini AWainwright RLiebrock L(2004)Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristicProceedings of the 2004 ACM symposium on Applied computing10.1145/967900.967910(35-36)Online publication date: 14-Mar-2004
https://dl.acm.org/doi/10.1145/967900.967910
Nishimoto RTani J(2003)Learning to generate combinatorial action sequences utilizing the initial sensitivity of deterministic dynamical systemsProceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 110.5555/1762716.1762774(422-429)Online publication date: 3-Jun-2003
https://dl.acm.org/doi/10.5555/1762716.1762774
Aiex RResende MRibeiro C(2002)Probability Distribution of Solution Time in GRASPJournal of Heuristics10.1023/A:10150618026598:3(343-373)Online publication date: 1-May-2002
https://dl.acm.org/doi/10.1023/A%3A1015061802659
Yagiura MIbaraki T(2001)Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SATJournal of Heuristics10.1023/A:10113060114377:5(423-442)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.1023/A%3A1011306011437

Abstract

Cited By

Recommendations

Efficient and experimental meta-heuristics for MAX-SAT problems

Guided Local Search for Solving SAT and Weighted MAX-SAT Problems

Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations