Two-agent advertisement scheduling on physical books to maximize the total profit

DOI10.1142/S0217595919500143zbMATH Open1418.90112OpenAlexW2944076076MaRDI QIDQ5223044FDOQ5223044

Authors: Kuen-Fang Jea, Jen-Ya Wang, Chih-Wei Hsu 

Publication date: 5 July 2019

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595919500143

Recommendations

• Approximating the advertisement placement problem
• Scheduling web advertisements: a note on the minspace problem
• Scheduling advertisements on a web page to maximize revenue
• scientific article; zbMATH DE number 2086937
• Scheduling banner advertisements on the web

zbMATH Keywords

branch-and-bound algorithmbig dataupper boundtwo-agent schedulingadvertisement scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Marketing, advertising (90B60)

Cites Work

• Introduction to algorithms.
• An approximation algorithm for the generalized assignment problem
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• A note on upper bounds to the robust knapsack problem with discrete scenarios
• Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
• Solving a two-agent single-machine scheduling problem considering learning effect
• A branch-and-bound algorithm for hard multiple knapsack problems
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
• Scheduling banner advertisements on the web
• Maximizing revenue with allocation of multiple advertisements on a Web banner
• Title not available (Why is that?)
• An exact algorithm for the budget-constrained multiple knapsack problem
• Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear

Cited In (2)

• Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
• An application of approximate dynamic programming in multi-period multi-product advertising budgeting

This page was built for publication: Two-agent advertisement scheduling on physical books to maximize the total profit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223044)