|
|||||
|
|
The partition problem |
|
| Authors: | Sunil Chopra M. R. Rao |
| Affiliation: | (1) Department of Managerial Economics and Decision Sciences, J.L. Kellogg Graduate School of Management, Northwestern University, 60208 Evanston, IL, USA;(2) Leonard N. Stern School of Business, New York University, New York, USA |
| Abstract: | In this paper we describe several forms of thek-partition problem and give integer programming formulations of each case. The dimension of the associated polytopes and some basic facets are identified. We also give several valid and facet defining inequalities for each of the polytopes.Partial Support from NSF Grants DMS 8606188 and ECS 8800281 is gratefully acknowledged. |
| Keywords: | Graph partition multiway cut polytope facet |
| 本文献已被 SpringerLink 等数据库收录！ | |