DSpace Repository

Data mining-based algorithm for assortment planning

Show simple item record

dc.contributor.author Sharma, Satyendra Kumar
dc.date.accessioned 2023-05-09T06:56:13Z
dc.date.available 2023-05-09T06:56:13Z
dc.date.issued 2020-02
dc.identifier.uri https://www.tandfonline.com/doi/abs/10.1080/23270012.2020.1725666?journalCode=tjma20
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/10715
dc.description.abstract With increasing varieties and products, management of limited shelf space becomes quite difficult for retailers. Hence, an efficient product assortment, which in turn helps to plan the organization of various products across limited shelf space, is extremely important for retailers. Products can be distinguished based on quality, price, brand, and other attributes, and decision needs to be made about an assortment of the products based on these attributes. An efficient assortment planning improves the financial performance of the retailer by increasing profits and reducing operational costs. Clustering techniques can be very effective in grouping products, stores, etc. and help managers solve the problem of assortment planning. This paper proposes data mining approaches for assortment planning for profit maximization with space, and cost constraints by mapping it into well-known knapsack problem en_US
dc.language.iso en en_US
dc.publisher Taylor & Francis en_US
dc.subject Management en_US
dc.subject Retail assortment en_US
dc.subject SKU rationalization en_US
dc.subject Data Mining en_US
dc.title Data mining-based algorithm for assortment planning en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account