On Permutations and Permutation Polytopes

Young HP (1978). On Permutations and Permutation Polytopes. IIASA Research Report. IIASA, Laxenburg, Austria: RR-78-005

[img]
Preview
Text
RR-78-005.pdf

Download (548kB) | Preview

Abstract

Permutation polytopes arise in a class of problems in which the objective is to find an optimal complete ordering of some given alternatives, subject to a linear objective criterion. In this paper 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.

The methods used are combinatorial in nature.

Item Type: Monograph (IIASA Research Report)
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:44
Last Modified: 19 Jul 2016 09:21
URI: http://pure.iiasa.ac.at/837

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