algorithm. We prove that the associated column generation subproblem is indeed NP-Complete, and propose a simple, greedy … heuristic to overcome the complexity of an exact algorithm. Our computational results show that the heuristic is quite effective …

to implement and do not require solving any DLPs. Our algorithm achieves a regret bound of $O(\log k)$, where $k$ is the … system size. To the best of our knowledge, this is the first NRM algorithm that (i) has an $o(\sqrt{k})$ asymptotic regret …

This paper is devoted to the development of heuristics for the dynamic pricing problem. A discrete time model of … dynamic pricing on the fixed time horizon is proposed. It is applicable to products that satisfy two properties: 1) product … techniques. Optimal pricing policy is expressed as a function of time to expiration and inventory levels of unsold products. An …