MULTIPLE-CHOICE KNAPSACK PROBLEM

被引:241
作者
SINHA, P [1 ]
ZOLTNERS, AA [1 ]
机构
[1] NORTHWESTERN UNIV,EVANSTON,IL 60201
关键词
D O I
10.1287/opre.27.3.503
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:503 / 533
页数:31
相关论文
共 5 条
[1]   MATHEMATICAL-PROGRAMMING SYSTEM FOR PREFERENCE AND COMPATIBILITY MAXIMIZED MENU PLANNING AND SCHEDULING [J].
BALINTFY, JL ;
ROSS, GT ;
SINHA, P ;
ZOLTNERS, AA .
MATHEMATICAL PROGRAMMING, 1978, 15 (01) :63-76
[2]  
BEALE E, 1969, 5TH P INT C OP RES, P821
[3]  
MONROE KB, UNPUBLISHED
[4]  
NAUSS RM, 1975, 0 1 KNAPSACK PROBLEM
[5]  
SINHA P, 1978, 7846 NW U GRAD SCH M