| Document Date: 2013-01-05 09:50:09
Open Document File Size: 472,33 KBShare Result on Facebook
City Haifa / Herzliya / Jersey City / Ramat-Gan / Redmond / / Company Gi 7 Indeed / Google / Microsoft / Knight Capital Group / IBM / / Country Israel / / Currency pence / USD / / / Facility The Interdisciplinary Center / Bar-Ilan University / / IndustryTerm item utilities / feasible solution / approximation algorithm / relaxed-agap solution / final solution / arbitrary utilities / feasible relaxed-agap solution / agap solution / recent media / e -approximate / fractional solution / media / e -approximation / media audience / Job processing times / advertising campaign / dual-based branch-and-bound algorithms / all-or-nothing / advertising campaigns / web-banners / approximation algorithms / media screens / / Organization School of Computer / Bar-Ilan University / Interdisciplinary Center / Computer Science Department / Technion / / Position General / wb / / ProvinceOrState New Jersey / Washington / / Technology dual-based branch-and-bound algorithms / approximation algorithm / cable TV technology / deriving approximation algorithms / 2 Approximation Algorithm / /
SocialTag |
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T