.png){kind=icon}
返回
Implementing TURF analysis through binary linear programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.foodqual.2012.10.001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces the approach of using Total Unduplicated Reach and Frequency (TURF) analysis to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Total Unduplicated Reach and Frequency
Market research
Competitive algorithm
Product optimization
Large datasets
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
4.3K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Two new location covering problems: The partial P-center problem and the partial set covering problem两个新的位置覆盖问题: 部分P中心问题和部分集合覆盖问题OAAI
OAAI分享收藏分享收藏分享收藏分享收藏
查看更多内容