Computational Experience with an Interior Point Algorithm on the Satisfiability Problem

Authors:
A. P. Kamath;Narendra Karmarkar;K. G. Ramakrishnan;Mauricio G. C. Resende
Affiliations:
-;-;-;-
Venue:
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
Year:
1990

Citing 0
Cited 5

Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

Journal of Automated Reasoning
The state of SAT

Discrete Applied Mathematics
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks

Proceedings of the 4th Annual International Conference on Wireless Internet
Hard and easy distributions of SAT problems

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Practical computation of optimal schedules in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract