A family of facets for the uncapacitated p-median polytope

被引：15

作者：

de Farias, IR ^{[1
]}

机构：

[1] SUNY Buffalo, Dept Ind Engn, Buffalo, NY 14260 USA

来源：

OPERATIONS RESEARCH LETTERS | 2001年 / 28卷 / 04期

关键词：

mixed-integer programming; p-median; facility location; cardinality constrained programming; branch-and-cut;

D O I：

10.1016/S0167-6377(01)00062-1

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 [运筹学与控制论]; 12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

We present a nontrivial family of facet-defining inequalities for the uncapacitated p-median polytope. We incorporate the inequalities in a branch-and-cut scheme, and we report computational results that demonstrate their effectiveness. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：161 / 167

页数：7

共 29 条

[1]

Capacitated facility location: Separation algorithms and computational experience [J].