All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns

DOI10.1145/2843944zbMath1445.90049OpenAlexW2343846702MaRDI QIDQ4962615

Rohit Khandekar, Elad Haramaty, Roy Schwartz, Ron Adany, Baruch Schieber, Moran Feldman, Hadas Shachnai, Tami Tamir

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2843944

zbMATH Keywords

generalized assignment problemapproximation algorithmsad placementgroup packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25) Marketing, advertising (90B60)

Related Items (4)

An APTAS for bin packing with clique-graph conflicts ⋮ A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising ⋮ Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays ⋮ Unnamed Item

This page was built for publication: All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns