%S Mathematical Programming Studies
%A H.P. Young
%T On permutations and permutation polytopes
%X An easy characterization is given of neighbors on permutation polytopes. Using this characterization it is shown that the graph of any such polytope is Hamiltonian, and that the diameter is two.
%P 128-140
%B Polyhedral Combinatorics
%E M. L. Balinski
%E A.J. Hoffman
%V 8
%C Germany
%D 2009
%I Springer Berlin Heidelberg
%R 10.1007/BFb0121198
%L iiasa14040