On multi-index assignment polytopes

被引：11
|
作者：
Appa, G.
Magos, D.
Mourtos, I.
机构：
[1] Inst Educ Technol, Dept Informat, Egaleo 12210, Greece
[2] Univ London London Sch Econ & Polit Sci, Dept Operat Res, London WC2A 2AE, England
[3] Univ Patras, Dept Econ, Patras 26500, Greece
来源：
LINEAR ALGEBRA AND ITS APPLICATIONS | 2006年 / 416卷 / 2-3期
关键词：
polyhedral combinatorics; multi-index assignment; polytope; facet;
D O I：
10.1016/j.laa.2005.11.009
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We investigate an integer programming model for multi-dimensional assignment problems. This model enables us to establish the dimension for entire families of assignment polytopes, thus unifying and generalising previous results. In particular, we establish the dimension of the linear assignment polytope as well as that of every axial and planar assignment polytope. Further, for the axial polytopes, we identify a family of clique facets. We also give a necessary condition for the existence of a solution for assignment problems. (c) 2005 Elsevier Inc. All rights reserved.
引用
收藏
页码：224 / 241
页数：18
相关论文
共 50 条
12345