Search Algorithms

  1. Estimating Problem Instance Difficulty
    Kaindl et al., 2020 Semantic Scholar (0 citations as of 2020.10.24)
  2. A*+IDA*: A Simple Hybrid Search Algorithm
    Bu & Korf, 2019 Semantic Scholar (2 citations as of 2020.10.24)
  3. PA-Star: A disk-assisted parallel A-Star strategy with locality-sensitive hash for multiple sequence alignment
    Sundfeld et al., 2018 Semantic Scholar (2 citations as of 2020.10.24)
  4. Dynamic Potential Search - A New Bounded Suboptimal Search
    Gilon et al., 2014 Semantic Scholar (11 citations as of 2020.10.24)
  5. Enhanced Partial Expansion A*
    Goldenberg et al., 2014 Semantic Scholar (77 citations as of 2020.10.24)
  6. Implementing Fast Heuristic Search Code
    Burns et al., 2011 Semantic Scholar (37 citations as of 2020.10.24)
  7. On Transposition Tables for Single-Agent Search and Planning: Summary of Results
    Akagi et al., 2010 Semantic Scholar (18 citations as of 2020.10.24)
  8. A Parallel Implementation of Iterative-Deepening-A*
    Rao et al., 1987 Semantic Scholar (75 citations as of 2020.10.24)

    9. Combinatorial Problems

  9. A multi-objective open set orienteering problem
    Dutta et al., 2020 Semantic Scholar (0 citations as of 2020.10.24)
  10. Formulation and a Two-Phase Matheuristic for the Roaming Salesman Problem: Application to Election Logistics
    Shahmanzari et al., 2020 Semantic Scholar (1 citation as of 2020.10.24)
  11. The Set Orienteering Problem
    Archetti et al., 2018 Semantic Scholar (12 citations as of 2020.10.24)
  12. An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem
    Nouiri et al., 2018 Semantic Scholar (130 citations as of 2020.10.24)
  13. The Thief Orienteering Problem: Formulation and Heuristic Approaches
    Santos & Chagas, 2018 Semantic Scholar (3 citations as of 2020.09.18)
  14. Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis
    Paul & Helmert, 2016 Semantic Scholar (4 citations as of 2020.09.18)
  15. Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective
    Surynek et al., 2016 Semantic Scholar (48 citations as of 2020.09.18)
  16. Uncertain multiobjective traveling salesman problem
    Wang et al., 2015 Semantic Scholar (42 citations as of 2020.09.18)
  17. A survey on algorithmic approaches for solving tourist trip design problems
    Gavalas et al., 2014 Semantic Scholar (165 citations as of 2020.09.18)
  18. The orienteering problem with variable profits
    Erdoğan & Laporte, 2013 Semantic Scholar (41 citations as of 2020.09.18)
  19. The Attractive Traveling Salesman Problem
    Erdoğan et al., 2010 Semantic Scholar (24 citations as of 2020.09.18)
  20. On the parameterized complexity of the generalized rush hour puzzle
    Fernau et al., 2003 Semantic Scholar (19 citations as of 2020.09.18)
  21. Finding Optimal Solutions to Atomix
    Hüffner et al., 2001 Semantic Scholar (26 citations as of 2020.09.18)

    22. Other

  22. Speed-Up in Dynamic Programming
    Yao, 1987 Semantic Scholar (63 citations as of 2020.10.24)