Implementing TURF analysis through binary linear programming
This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) 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.
When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:1197. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.