New answers tagged integer-programming
0
votes
Path that stays within a convex polyhedron
Unfortunately the problem is EXPSPACE-hard. Reachability in Vector Addition Systems (VAS) is a special case of this problem, and is known to be EXPSPACE-hard.
In particular, consider the case where $\...
D.W.♦
- 169k
Top 50 recent answers are included