The Minimum Satisfiability Problem
From MaRDI portal
Publication:4296521
DOI10.1137/S0895480191220836zbMath0806.68060MaRDI QIDQ4296521
Ramesh Krishnamurti, Prakash Mirchandani, Rajeev Kohli
Publication date: 13 February 1995
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
Related Items
The computational complexity of the pooling problem, Single machine scheduling problems with uncertain parameters and the OWA criterion, A simplified NP-complete MAXSAT problem, Combinatorial optimization problems with uncertain costs and the OWA criterion, On reoptimizing multi-class classifiers, On the minimum hitting set of bundles problem, On dependent randomized rounding algorithms, Computing the Ehrhart polynomial of a convex lattice polytope, On approximation algorithms for the minimum satisfiability problem, Average performance of greedy heuristics for the integer knapsack problem., Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations, Optimizing with minimum satisfiability, Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems., Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion, Subset-conjunctive rules for breast cancer diagnosis, Quantum computation techniques for gauging reliability of interval and fuzzy data, Lower and Upper Bounds for Random Mimimum Satisfiability Problem, On the Minimum Hitting Set of Bundles Problem
