The solution of large-scale Minimum Cost SAT Problem as a tool for data analysis in bioinformatics.
Giovanni FeliciDaniele FeronePaola FestaAntonio NapoletanoTommaso PastorePublished in: PeerJ Prepr. (2016)
Keyphrases
- minimum cost
- network flow problem
- np hard
- network flow
- sat problem
- approximation algorithms
- network simplex algorithm
- spanning tree
- satisfiability problem
- capacity constraints
- optimal solution
- minimum cost flow
- np complete
- boolean satisfiability
- lagrangian relaxation
- sat instances
- stochastic local search
- genetic algorithm
- davis putnam
- information retrieval