Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
DOI10.1007/978-3-319-11558-0_52zbMATH Open1432.68420OpenAlexW27905376MaRDI QIDQ2938540FDOQ2938540
Mutsunori Banbara, Stéphanie Roussel, Naoyuki Tamura, Takehide Soh, Daniel Le Berre
Publication date: 14 January 2015
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_52
Recommendations
- A SAT based effective algorithm for the directed Hamiltonian cycle problem
- An effective algorithm for and phase transitions of the directed Hamiltonian cycle problem
- A logical model of HCP
- Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Computational aspects of satisfiability (68R07)
Cites Work
- Theory and Applications of Satisfiability Testing
- TSPLIB—A Traveling Salesman Problem Library
- A Decision Procedure for Bit-Vectors and Arrays
- Reducibility among Combinatorial Problems
- Solving QBF with Counterexample Guided Refinement
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
- Title not available (Why is that?)
- The traveling salesman problem: An overview of exact and approximate algorithms
- Complexity-sensitive decision procedures for abstract argumentation
- A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
- Recent advances on the Hamiltonian problem: survey III
- Advances on the Hamiltonian problem -- a survey
- Title not available (Why is that?)
- Towards Robust CNF Encodings of Cardinality Constraints
- Title not available (Why is that?)
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
- Computer Aided Verification
- SAT problems with chains of dependent variables
- Boolean satisfiability with transitivity constraints
- RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES
Cited In (7)
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- Chinese remainder encoding for Hamiltonian cycles
- MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers
- An incremental SAT-based approach for solving the real-time taxi-sharing service problem
- Concise integer linear programming formulation for clique partitioning problems
- Hamiltonian cycle reconfiguration with answer set programming
- A SAT based effective algorithm for the directed Hamiltonian cycle problem
Uses Software
This page was built for publication: Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938540)
