(1,K)-CONFIGURATION FACETS FOR THE GENERALIZED ASSIGNMENT PROBLEM

被引：14

作者：

GOTTLIEB, ES ^{[1
]}

RAO, MR ^{[1
]}

机构：

[1] NYU,STERN SCH BUSINESS,NEW YORK,NY 10003

来源：

MATHEMATICAL PROGRAMMING | 1990年 / 46卷 / 01期

关键词：

(1; k)-configurations; facets; Generalized assignment problem; integer polytope; knapsack problem; special ordered sets;

D O I：

10.1007/BF01585726

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

class of facet defining inequalities for the generalized assignment problem is derived. These inequalities are based upon multiple knapsack constraints and are derived from (1, k)-configuration inequalities. © 1990 North-Holland.

引用

页码：53 / 60

页数：8