Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles

Miroslav N. Velev, Ping Gao 0002. Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles. In Vadim Bulitko, J. Christopher Beck, editors, Eighth Symposium on Abstraction, Reformulation, and Approximation, SARA 2009, Lake Arrowhead, California, USA, 8-10 August 2009. AAAI, 2009. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.