A BRANCH AND BOUND ALGORITHM FOR THE LIST SELECTION PROBLEM IN DIRECT MAIL ADVERTISING

被引：26

作者：

DWYER, FR

EVANS, JR

机构：

来源：

关键词：

D O I：

10.1287/mnsc.27.6.658

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：658 / 667

页数：10

共 15 条

[1]

AAKER DA, 1968, J ADVERTISING RES, V8, P46

[2]

AGOSTINI JM, 1961, J ADVERTISING RES, V1, P11

[3] EXPLORATION OF LINEAR PROGRAMMING IN MEDIA SELECTION [J].

BASS, FM ;

LONSDALE, RT .

[4] PRACTICAL PROCEDURE FOR MEDIA SELECTION [J].

BROWN, DB .

[5]

CHARNES A, 1968, MANAGEMENT SCI, V141, P423

[6]

CLAYCAMP HJ, 1968, J ADVERTISING RES, V8, P44

[7]

Gensch D.H., 1973, ADVERTISING PLANNING

[8] COMPUTER MODELS IN ADVERTISING MEDIA SELECTION [J].

GENSCH, DH .

[9]

LIEBMAN L, 1974, J ADVERTISING RES, V14, P23

[10]

LITTLE JDC, 1966, IMR-IND MANAG REV, V8, P15