The k-assignment polytope
2009 (English)In: DISCRETE OPTIMIZATION, ISSN 1572-5286 , Vol. 6, no 2, 148-161 p.Article in journal (Refereed) Published
In this paper we Study the structure of the k-assignment polytope, whose vertices are the m x n (0, 1)-matrices with exactly k 1:s and at most one 1 in each row and each column. This is a natural generalisation of the Birkhoff polytope and many of the known properties of the Birkhoff polytope are generalised. A representation of the faces by certain bipartite graphs is given. This tool is used to describe the properties of the polytope, especially a complete description of the cover relation in the face poset of the polytope and an exact expression for the diameter. An ear decomposition of these bipartite graphs is constructed.
Place, publisher, year, edition, pages
2009. Vol. 6, no 2, 148-161 p.
Birkhoff polytope, Partial matching, Face poset, Ear decomposition, Assignment polytope
IdentifiersURN: urn:nbn:se:liu:diva-17621DOI: 10.1016/j.disopt.2008.10.003OAI: oai:DiVA.org:liu-17621DiVA: diva2:210918
Jonna Gill and Svante Linusson, The k-assignment polytope, 2009, DISCRETE OPTIMIZATION, (6), 2, 148-161.
Copyright: Elsevier Science B.V. Amsterdam