Optimizing with minimum satisfiability
61
TL;DR: This paper describes a branch-and-bound solver for Weighted Partial MinSAT equipped with original upper bounds that exploit both clique partitioning algorithms and MaxSAT technology and investigates an interesting correlation between the minimum number and the maximum number of satisfied clauses on random CNF formulae.
read more
About: This article is published in Artificial Intelligence. The article was published on 01 Oct 2012. and is currently open access. The article focuses on the topics: Maximum satisfiability problem & Combinatorial optimization.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Incremental Upper Bound for the Maximum Clique Problem
TL;DR: An incremental upper bound is proposed and combined with MaxSAT reasoning to develop an efficient branch-and-bound algorithm for MaxClique, called IncMaxCLQ and is compared with several state-of-the-art algorithms forMaxClique.
86
Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem
Chu Min Li,Zhiwen Fang,Ke Xu +2 more
- 04 Nov 2013
TL;DR: An incremental upper bound is proposed and used to develop an efficient branch-and-bound algorithm for MaxClique, called IncMaxCLQ, and the complementarity of the incrementalupper bound and MaxSAT reasoning is shown.
77
An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs
Hua Jiang,Chu Min Li,Felip Manyà +2 more
- 04 Feb 2017
TL;DR: This work is supported by NSFC Grants No. 61370184, the MeCS platform of the University of Picardie Jules Verne and the HPC platform of Jianghan Univeristy.
62
Supervised Learning Perspective in Logic Mining
Mohd Shareduwan Mohd Kasihmuddin,Siti Zulaikha Mohd Jamaludin,Mohd. Asyraf Mansor,Habibah A. Wahab,S. Ghadzi +4 more
TL;DR: The proposed supervised logic mining that integrates supervised learning via association analysis to identify the most optimal arrangement with respect to the given logical rule demonstrated superiority and the least competitiveness compared to the existing method.
An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem
Zhiwen Fang,Chu Min Li,Ke Xu +2 more
TL;DR: This paper applies MaxSAT reasoning to compute a tight upper bound for a Maximum Weight Clique (MWC) of a wighted graph and implements a branch-and-bound algorithm called MWCLQ, which outperforms state-of-the-art exact algorithms on the vast majority of instances.
References
•Proceedings Article
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
Yuzo Fujishima,Kevin Leyton-Brown,Yoav Shoham +2 more
- 31 Jul 1999
TL;DR: This work proposes two methods of overcoming apparent intractability in combinatorial auctions by structuring the search space so that a modified depth-first search usually avoids even considering allocations that contain conflicting bids.
Towards a universal test suite for combinatorial auction algorithms
Kevin Leyton-Brown,Mark Pearson,Yoav Shoham +2 more
- 17 Oct 2000
TL;DR: This paper presents a suite of distribution families for generating realistic, economically motivated combinatorial bids in five broad real-world domains, and hopes that this work will yield many comments, criticisms and extensions, bringing the community closer to a universal combinatorsial auction test suite.
An efficient branch-and-bound algorithm for finding a maximum clique
Etsuji Tomita,Tomokazu Seki +1 more
TL;DR: It is demonstrated by computational experiments on random graphs with up to 15,000 vertices and on DIMACS benchmark graphs that the algorithm remarkably outperforms other existing algorithms in general.
273
•Journal Article
Efficient branch-and-bound algorithms for finding a maximum clique
Tomokazu Seki,Etsuji Tomita +1 more
188