I am trying to formulate any NP Optimization (or Combinatorial Optimization) problem as a generic search problem that can be solved with the shortest pathfinding algorithms like BFS, DFS, A*, etc.

Is this even possible (or can it be shown that it's not possible?).

I am using definitions on the Wikipedia page: https://en.wikipedia.org/wiki/Combinatorial_optimization



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.