ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1806.09487
  4. Cited By
Finding Optimal Solutions to Token Swapping by Conflict-based Search and
  Reduction to SAT

Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT

25 June 2018
Pavel Surynek
ArXiv (abs)PDFHTML

Papers citing "Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT"

1 / 1 papers shown
Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path
  Finding through Combination of Satisfiability Modulo Theories and
  Conflict-based Search
Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search
Pavel Surynek
92
6
0
16 Sep 2018
1
Page 1 of 1