✦ LIBER ✦

On multi-index assignment polytopes

✍ Scribed by G. Appa; D. Magos; I. Mourtos

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 232 KB
Volume: 416
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.11.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Determining adjacent vertices on assignm

Determining adjacent vertices on assignment polytopes

✍ Patrick G. McKeown 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 353 KB

## Abstract To rank the solutions to the assignment problem using an extreme point method, it is necessary to be able to find all extreme points which are adjacent to a given extreme solution. Recent work has shown a procedure for determining adjacent vertices on transportation polytopes using a mo

Multi-index axial assignment problem on

Multi-index axial assignment problem on single-cyclic permutations

✍ Edward Gimadi; Natalie Kairan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Linear-time separation algorithms for th

Linear-time separation algorithms for the three-index assignment polytope

✍ Egon Balas; Liqun Qi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 641 KB

On removing a vertex from the assignment

On removing a vertex from the assignment polytope

✍ Allan B. Cruse 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 782 KB

A note on certain subpolytopes of the as

A note on certain subpolytopes of the assignment polytope associated with circulant graphs

✍ H. Schreck; G. Tinhofer 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 448 KB

On k-stacked polytopes

✍ Peter Kleinschmidt; Carl W Lee 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 142 KB

It is proved that equality in the Generalized Simplicial Lower Bound Conjecture can always be obtained by k-stacked polytopes. Let P be a simplicial convex d-polytope with f~ faces of dimension i. The vector f(P) = (f0 ..... fa-1) is called the f-vector of P. The complete characterization of all f-