IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v36y2019i03ns0217595919500143.html
   My bibliography  Save this article

Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit

Author

Listed:
  • Kuen-Fang Jea

    (Department of Computer Science and Engineering, National Chung-Hsing University, Taichung, Taiwan, R.O.C.)

  • Jen-Ya Wang

    (Department of Computer Science and Information Management, Hungkuang University, Taichung, Taiwan, R.O.C.)

  • Chih-Wei Hsu

    (Department of Computer Science and Engineering, National Chung-Hsing University, Taichung, Taiwan, R.O.C.)

Abstract

Most of us may have had the experience of forgetting some term from a physical book when the term appears in neither the table of contents nor the index. Unfortunately, we must search for it page by page. In one edition of the popular physical book “Harry Potter and the Sorcerer’s Stone”, for example, the term “dragon’s blood” only appears on pages 81 and 175, so browsing through the whole book to find it would be inevitable. In this study, a mechanism is provided to carry out an online search on physical books. To financially support this mechanism, we can put online advertisements with different offers on these physical books. An advertisement scheduling problem (ASP) is therefore formulated to maximize the total profit. To obtain the optimal schedules, we propose a branch-and-bound algorithm equipped with an upper bound. Experimental results show that the proposed upper bound performs well and completes the search in only 4% of the execution time of an ordinary branch-and-bound algorithm.

Suggested Citation

  • Kuen-Fang Jea & Jen-Ya Wang & Chih-Wei Hsu, 2019. "Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(03), pages 1-24, June.
    • Handle: RePEc:wsi:apjorx:v:36:y:2019:i:03:n:s0217595919500143
    DOI: 10.1142/S0217595919500143
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595919500143
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595919500143?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Marc Goerigk, 2014. "A note on upper bounds to the robust knapsack problem with discrete scenarios," Annals of Operations Research, Springer, vol. 223(1), pages 461-469, December.
    2. Syam Menon & Ali Amiri, 2004. "Scheduling Banner Advertisements on the Web," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 95-105, February.
    3. Alex Fukunaga, 2011. "A branch-and-bound algorithm for hard multiple knapsack problems," Annals of Operations Research, Springer, vol. 184(1), pages 97-119, April.
    4. D. Quadri & E. Soutif & P. Tolla, 2009. "Exact solution method to solve large scale integer quadratic multidimensional knapsack problems," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 157-167, February.
    5. Lang, Fabian & Fink, Andreas & Brandt, Tobias, 2016. "Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling," European Journal of Operational Research, Elsevier, vol. 248(1), pages 192-203.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tomohiko Mizutani & Makoto Yamashita, 2013. "Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables," Journal of Global Optimization, Springer, vol. 56(3), pages 1073-1100, July.
    2. Gudmundsson, Jens & Hougaard, Jens Leth & Platz, Trine Tornøe, 2023. "Decentralized task coordination," European Journal of Operational Research, Elsevier, vol. 304(2), pages 851-864.
    3. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    4. SYAFITRI, Utami & SARTONO, Bagus & GOOS, Peter, 2015. "D- and I-optimal design of mixture experiments in the presence of ingredient availability constraints," Working Papers 2015003, University of Antwerp, Faculty of Business and Economics.
    5. Selçuk, B. & Özlük, Ö., 2013. "Optimal keyword bidding in search-based advertising with target exposure levels," European Journal of Operational Research, Elsevier, vol. 226(1), pages 163-172.
    6. Federico Della Croce & Dominique Quadri, 2012. "Improving an exact approach for solving separable integer quadratic knapsack problems," Journal of Combinatorial Optimization, Springer, vol. 23(1), pages 21-28, January.
    7. Prerna Manik & Anshu Gupta & P. C. Jha & Kannan Govindan, 2016. "A Goal Programming Model for Selection and Scheduling of Advertisements on Online News Media," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(02), pages 1-41, April.
    8. Lili Hai & Lan Zhao & Anna Nagurney, 2010. "An integrated framework for the design of optimal web banners," Netnomics, Springer, vol. 11(1), pages 69-83, April.
    9. Deane, Jason & Agarwal, Anurag, 2012. "Scheduling online advertisements to maximize revenue under variable display frequency," Omega, Elsevier, vol. 40(5), pages 562-570.
    10. Gärttner, Johannes & Flath, Christoph M. & Weinhardt, Christof, 2018. "Portfolio and contract design for demand response resources," European Journal of Operational Research, Elsevier, vol. 266(1), pages 340-353.
    11. Martello, Silvano & Monaci, Michele, 2020. "Algorithmic approaches to the multiple knapsack assignment problem," Omega, Elsevier, vol. 90(C).
    12. Homberger, Jörg & Fink, Andreas, 2017. "Generic negotiation mechanisms with side payments – Design, analysis and application for decentralized resource-constrained multi-project scheduling problems," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1001-1012.
    13. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
    14. Olivier Lalonde & Jean-François Côté & Bernard Gendron, 2022. "A Branch-and-Price Algorithm for the Multiple Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3134-3150, November.
    15. X. J. Zheng & X. L. Sun & D. Li, 2010. "Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 463-489, August.
    16. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.
    17. Zhongshun Shi & Siyang Gao & Hui Xiao & Weiwei Chen, 2019. "A worst‐case formulation for constrained ranking and selection with input uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(8), pages 648-662, December.
    18. Kumar, Subodha & Sethi, Suresh P., 2009. "Dynamic pricing and advertising for web content providers," European Journal of Operational Research, Elsevier, vol. 197(3), pages 924-944, September.
    19. Setzer, Thomas & Blanc, Sebastian M., 2020. "Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems," European Journal of Operational Research, Elsevier, vol. 282(1), pages 58-70.
    20. Fink, Andreas & Gerhards, Patrick, 2021. "Negotiation mechanisms for the multi-agent multi-mode resource investment problem," European Journal of Operational Research, Elsevier, vol. 295(1), pages 261-274.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:36:y:2019:i:03:n:s0217595919500143. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.