If you need an accessible version of this item please contact JSTOR User Support

Permutation Polyhedra

V. J. Bowman
SIAM Journal on Applied Mathematics
Vol. 22, No. 4 (Jun., 1972), pp. 580-589
Stable URL: http://www.jstor.org/stable/2099695
Page Count: 10
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Permutation Polyhedra
Preview not available

Abstract

Certain combinatorial optimization problems can be solved easily because of the existence of a linear cost function over special polyhedra whose extreme points can be associated with the feasible combinations. One of the simpler examples is the polyhedron associated with assignment problems. This paper introduces the concept of permutation polyhedra which provides a natural framework for discussing linear programming formulations of combinatorial problems that is dependent on isomorphisms between feasible combinations and extreme points of a polyhedron rather than construction of meaningful variables and their intuitively associated linear constraints. In addition, a new permutation polyhedron is constructed starting with an isomorphism between permutations and special graphs.

Page Thumbnails

  • Thumbnail: Page 
580
    580
  • Thumbnail: Page 
581
    581
  • Thumbnail: Page 
582
    582
  • Thumbnail: Page 
583
    583
  • Thumbnail: Page 
584
    584
  • Thumbnail: Page 
585
    585
  • Thumbnail: Page 
586
    586
  • Thumbnail: Page 
587
    587
  • Thumbnail: Page 
588
    588
  • Thumbnail: Page 
589
    589