Abstract
An integer programming model is given to deal with the problem that an online store wants to arrange the display time of goods pictures within the given scheduling horizon and space in order to maximize its profits. In this model, two characters that goods pictures have effect on demands and there are no inventories in many online stores are considered. It is explained that the problem discussed is equivalent to a special multiple-choice knapsack problem, so a dynamic programming algorithm with a complexity of pseudo polynomial time is provided; the properties of the objective function are studied, a greedy-like heuristic algorithm based on them with a complexity of polynomial time is proposed, and an example is given to demonstrate that the greedy-like heuristic method is effective.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
