Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study the problems of picking the media where a good or service is advertised in such a way the cost of placing these advertisements is minimized but, simultaneously, the individuals of some given population segments reach some minimum average advertisement impressions (views); or they reach some minimum probabilities of watching the advertisement at least once; or they reach both. The proposed model lets the publicist explicitly define the dependencies beten media audience (i.e., whether viers of some medium typically watch some other medium; or typically do not watch it; or typically watch it as the rest of the audience).  prove the Log-APX-hardness of these three problems.  present two heuristics to suboptimally solve each of these problems (one greedy and the other one based on genetic algorithms) and compare their performance for several problem instances.
['Ismael Rodríguez', 'Fernando Rubio', 'Pablo Rabanal']
I am writing a research paper on a idea Automatic media planning: Optimal advertisement placement problems
[{"from": "human", "value": "I am writing a research paper on a idea Automatic media planning: Optimal advertisement placement problems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study the problems of picking the media where a good or service is advertised in such a way the cost of placing these advertisements is minimized but, simultaneously, the individuals of some given population segments reach some minimum average advertisement impressions (views); or they reach some minimum probabilities of watching the advertisement at least once; or they reach both. The proposed model lets the publicist explicitly define the dependencies beten media audience (i.e., whether viers of some medium typically watch some other medium; or typically do not watch it; or typically watch it as the rest of the audience).  prove the Log-APX-hardness of these three problems.  present two heuristics to suboptimally solve each of these problems (one greedy and the other one based on genetic algorithms) and compare their performance for several problem instances."}]