On permutations and permutation polytopes

Young HP (2009). On permutations and permutation polytopes. In: Polyhedral Combinatorics. Eds. Balinski, M. L. & Hoffman, A.J., Mathematical Programming Studies, 8 . pp. 128-140 Germany: Springer Berlin Heidelberg. ISBN 978-3-642-00790-3 DOI:10.1007/BFb0121198.

Full text not available from this repository.

Abstract

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.

Item Type: Book Section
Research Programs: World Population (POP)
Depositing User: Romeo Molina
Date Deposited: 01 Dec 2016 09:55
Last Modified: 01 Dec 2016 09:55
URI: http://pure.iiasa.ac.at/14040

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313