# Item Listing Optimization for E-commerce Websites based on Diversity

arXiv: https://arxiv.org/abs/1903.12478 · HTML: https://mlsanity.com/paper/1903.12478/

## Key facts

- Cited by 8 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Mar 2019.

## Built on by (most cited first, 8 of 8)

- [Feature Selection for Recommender Systems with Quantum Computing](https://mlsanity.com/paper/2110.05089/) (2021)
- [Black-box optimization for integer-variable problems using Ising machines and factorization machines](https://mlsanity.com/paper/2209.01016/) (2022)
- [Multi-objective QUBO Solver: Bi-objective Quadratic Assignment](https://mlsanity.com/paper/2205.13399/) (2022)
- [Assessment of image generation by quantum annealer](https://mlsanity.com/paper/2103.08373/) (2021)
- [Relaxation-assisted reverse annealing on nonnegative/binary matrix factorization](https://mlsanity.com/paper/2501.02114/) (2025)
- [Solving Large Break Minimization Problems in a Mirrored Double Round-robin Tournament Using Quantum Annealing](https://mlsanity.com/paper/2110.07239/) (2021)
- [Efficient correlation-based discretization of continuous variables for annealing machines](https://mlsanity.com/paper/2301.07244/) (2023)
- [Data-Driven Discrete Geofence Design Using Binary Quadratic Programming](https://mlsanity.com/paper/2509.24679/) (2025)

## Abstract (arXiv)

For e-commerce websites, deciding the manner in which items are listed on webpages is an important issue because it can dramatically affect item sales. One of the simplest strategies of listing items to improve the overall sales is to do so in a descending order of sales or sales numbers. However, in lists generated using this strategy, items with high similarity are often placed consecutively. In other words, the generated item list might be biased toward a specific preference. Therefore, this study employs penalties for items with high similarity being placed next to each other in the list and transforms the item listing problem to a quadratic assignment problem (QAP). The QAP is well-known as an NP-hard problem that cannot be solved in polynomial time. To solve the QAP, we employ quantum annealing (QA), which exploits the quantum tunneling effect to efficiently solve an optimization problem. In addition, we propose a problem decomposition method based on the structure of the item listing problem because the quantum annealer we use (i.e., D-Wave 2000Q) has a limited number of quantum bits. Our experimental results indicate that we can create an item list that considers both sales and diversity. In addition, we observe that using the problem decomposition method based on a problem structure can lead to a better solution with the quantum annealer in comparison with the existing problem decomposition method.