Exact Algorithms for MAX-SAT-Reference-Cited by-同舟云学术

Exact Algorithms for MAX-SAT

Published:2003-05 Issue:1 Volume:86 Page:190-203
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Zhang Hantao,Shen Haiou,Manyà Felip

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference24 articles.

1. J. Alber, J. Gramm, R. Niedermeier, Faster exact algorithms for hard problems: A parameterized point of view. Preprint, submitted to Elsevier, August, 2000

2. F.A. Aloul, A. Ramani, I.L. Markov, K.A. Sakallah, Generic ILP versus specialized 0-1 ILP: An update. Technical Report CSE-TR-461-02, University of Michigan, Ann Arbor, Michigan, Aug., 2002.

3. T. Alsinet, F. Manyà, J. Planes, Improved branch and bound algorithms for Max-SAT. Proc. of 6th International Conference on the Theory and Applications of Satisfiability Testing, SAT2003, pages 408–415.

4. T. Alsinet, F. Manyà, J. Planes, Improved branch and bound algorithms for Max-2-SAT and weighted Max-2-SAT. Catalonian Conference on Artificial Intelligence, 2003.

5. Hardness of approximation;Arora,1997

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The 2-MAXSAT Problem Can Be Solved in Polynomial Time;2022 International Conference on Computational Science and Computational Intelligence (CSCI);2022-12

2. On Preprocessing for Weighted MaxSAT;Lecture Notes in Computer Science;2021

3. Mixed-cell-height placement considering drain-to-drain abutment;Proceedings of the International Conference on Computer-Aided Design;2018-11-05

4. MAX-SAT Problem using Hybrid Harmony Search Algorithm;Journal of Intelligent Systems;2018-10-25

5. Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT;Theory and Applications of Satisfiability Testing – SAT 2018;2018