Solving a permutation problem by a fully polynomial-time approximation scheme
For a problem of optimal discrete control with a discrete control set composed of vertices of an n-dimensional permutohedron, a fully polynomial-time approximation scheme is proposed.