Before revision:  We then use this to present a total polynomial time algorithm for polytopes P for which the branch-width of the linear matroid generated by S is bounded by a constant k.
After revision:  We then use this to present a total polynomial time algorithm for polytopes P for which the branch-width of the linear matroid generated by A is bounded by a constant k.