Two-agent advertisement scheduling on physical books to maximize the total profit (Q5223044)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two-agent advertisement scheduling on physical books to maximize the total profit |
scientific article; zbMATH DE number 7077141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-agent advertisement scheduling on physical books to maximize the total profit |
scientific article; zbMATH DE number 7077141 |
Statements
Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit (English)
0 references
5 July 2019
0 references
advertisement scheduling
0 references
two-agent scheduling
0 references
branch-and-bound algorithm
0 references
upper bound
0 references
big data
0 references
0 references
0 references
0.755928635597229
0 references
0.7529964447021484
0 references
0.7518338561058044
0 references
0.7422636151313782
0 references
