eprintid: 14040
rev_number: 6
eprint_status: archive
userid: 5
dir: disk0/00/01/40/40
datestamp: 2016-12-01 09:55:10
lastmod: 2021-08-27 17:28:09
status_changed: 2016-12-01 09:55:10
type: book_section
metadata_visibility: show
item_issues_count: 2
creators_name: Young, H.P.
creators_id: AL1397
title: On permutations and permutation polytopes
ispublished: pub
divisions: prog_pop
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.
date: 2009
date_type: published
publisher: Springer Berlin Heidelberg
id_number: 10.1007/BFb0121198
creators_browse_id: 2539
full_text_status: none
series: Mathematical Programming Studies
volume: 8
place_of_pub: Germany
pagerange: 128-140
refereed: TRUE
isbn: 978-3-642-00790-3
issn: 0303-3929
book_title: Polyhedral Combinatorics
editors_name: Balinski, M. L.
editors_name: Hoffman, A.J.
coversheets_dirty: FALSE
fp7_type: info:eu-repo/semantics/bookPart
citation:   Young, H.P. <https://pure.iiasa.ac.at/view/iiasa/2539.html>  (2009).  On permutations and permutation polytopes.    In:  Polyhedral Combinatorics. Eds. Balinski, M. L. & Hoffman, A.J., pp. 128-140 Germany: Springer Berlin Heidelberg.  ISBN 978-3-642-00790-3 10.1007/BFb0121198 <https://doi.org/10.1007/BFb0121198>.