scientific article; zbMATH DE number 2086937
From MaRDI portal
Publication:4737542
Recommendations
- Approximating the advertisement placement problem
- A polynomial-time approximation scheme for the MAXSPACE advertisement problem
- scientific article; zbMATH DE number 2038780
- A mathematical programming study of advertising allocation problem.
- The adwords problem with strict capacity constraints
- A linear programming approach for determining optimal advertising policy
- A hybrid algorithm for the adwords problem
- On a discrete model of optimal advertising
Cited in
(16)- Approximating the advertisement placement problem
- Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
- Hardness of approximation for orthogonal rectangle packing and covering problems
- Approximation algorithms for the MAXSPACE advertisement problem
- A polynomial-time approximation scheme for the MAXSPACE advertisement problem
- A System Point Approach to Nonuniform Advertising Insertions
- Prompt mechanism for ad placement over time
- Scheduling advertisement on a Web Weg Page: New and improved approximation algorithms
- scientific article; zbMATH DE number 1479855 (Why is no real title available?)
- Maximally representative allocations for guaranteed delivery advertising campaigns
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- Scheduling web advertisements: a note on the minspace problem
- Local-search based heuristics for advertisement scheduling
- scientific article; zbMATH DE number 2038780 (Why is no real title available?)
- Two-agent advertisement scheduling on physical books to maximize the total profit
- Nonparametric advertising budget allocation with inventory constraint
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737542)
