Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
- 1 January 2014
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Complexity-sensitive decision procedures for abstract argumentationArtificial Intelligence, 2014
- To Encode or to Propagate? The Best Choice for Each Constraint in SATLecture Notes in Computer Science, 2013
- Lynx: A Programmatic SAT Solver for the RNA-Folding ProblemLecture Notes in Computer Science, 2012
- A hybrid simulation-optimization algorithm for the Hamiltonian cycle problemAnnals of Operations Research, 2009
- A Decision Procedure for Bit-Vectors and ArraysPublished by Springer Science and Business Media LLC ,2007
- A Translation of Pseudo-Boolean Constraints to SATJournal on Satisfiability, Boolean Modeling and Computation, 2006
- An Extensible SAT-solverLecture Notes in Computer Science, 2004
- Boolean satisfiability with transitivity constraintsACM Transactions on Computational Logic, 2002
- Counterexample-Guided Abstraction RefinementLecture Notes in Computer Science, 2000
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980