Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit
From MaRDI portal
Publication:5223044
DOI10.1142/S0217595919500143zbMath1418.90112OpenAlexW2944076076MaRDI QIDQ5223044
Chih-Wei Hsu, Kuen-Fang Jea, Jen-Ya Wang
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Marketing, advertising (90B60)
Related Items (2)
An application of approximate dynamic programming in multi-period multi-product advertising budgeting ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
- A branch-and-bound algorithm for hard multiple knapsack problems
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- An approximation algorithm for the generalized assignment problem
- Solving a two-agent single-machine scheduling problem considering learning effect
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear
- An exact algorithm for the budget-constrained multiple knapsack problem
- Scheduling Banner Advertisements on the Web
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
This page was built for publication: Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit