Login / Signup

On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles.

Marcus GozonJingjin Yu
Published in: AAAI (2024)
Keyphrases
  • optimal solution
  • lower bound
  • np hard
  • objective function
  • scheduling problem
  • metaheuristic
  • solution space
  • feasible solution
  • reinforcement learning
  • upper bound
  • branch and bound
  • branch and bound algorithm