Scheduling banner advertisements on the web

INFORMS Journal on Computing

Volumn 16, Issue 1, 2004, Pages 95-105

  Menon, Syam ^a   Amiri, Ali ^b  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b OKLAHOMA STATE UNIVERSITY   (United States)

Author keywords

Banner advertising; Column generation; Internet; Lagrangean decomposition; Scheduling

Indexed keywords

COSTS; DATA STRUCTURES; LAGRANGE MULTIPLIERS; MARKETING; PURCHASING; RANDOM PROCESSES; SCHEDULING; SOCIETIES AND INSTITUTIONS;

BANNER ADVERTISING; COLUMN GENERATION; COST PER THOUSAND EXPOSURES (CPM); LAGRANGEAN DECOMPOSITION;

WORLD WIDE WEB;

EID: 3843136138     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1020.0003     Document Type: Article

References (27)

1. Adler, M., P. Gibbons, Y. Matias. 2002. Scheduling space sharing for internet advertising. J. Scheduling 5 103-119.
2. Amiri, A., S. Menon. 2001. Efficient scheduling of internet banner advertisements. Working paper, College of Business, Oklahoma State University, Stillwater, OK.
3. Balas, E., E. Zemel. 1980. An algorithm for large zero-one knapsack problems. Oper. Res. 28 1130-1154.
4. Bazarra, M., H. Sherali, C. Shetty. 1993. Nonlinear Programming Theory and Algorithms. John Wiley & Sons, New York.
5. Buchwalter, C. M. Ryan, D. Martin. 2001. The state of online advertising: Data covering fourth quarter 2000. Technical Report, AdRelevance (a Jupiter Media Metrix company), Seattle, WA.
6. Caprara, A., H. Kellerer, U. Pferschy. 2000. The multiple subset sum problem. SIAM J. Optim. 11 308-319.
7. Dantzig G., P. Wolfe. 1960. Decomposition principle for linear programs. Oper. Res. 8 101-111.
8. Degraeve, Z., L. Schrage. 1999. Optimal integer solutions to cutting stock problems. INFORMS J. Comput. 11 406-419.
9. Fisher, M. 1981. The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27 1-18.
10. Garey, M., R. Graham. 1975. Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4 187-200.
11. Geoffrion, A. 1974. Lagrangean relaxation for integer programming. Math. Programming Stud. 2 82-114.
12. Gilmore, P., R. Gomory. 1961. A linear programming approach to the cutting stock problem. Oper. Res. 9 849-859.
13. Gilmore P., R. Gomory. 1963. A linear programming approach to the cutting stock problem - Part II. Oper. Res. 11 863-888.
14. Guignard M., S. Kim. 1987. Lagrangean decomposition: A model yielding stronger Lagrangean bounds. Math. Programming 39 215-228.
15. Held, M., R. Karp. 1970. The traveling salesman problem and minimum spanning trees. Oper. Res. 18 1138-1162.
16. Held, M., R. Karp. 1971. The traveling salesman problem and minimum spanning trees - Part II. Math. Programming 1 6-25.
17. Interactive Advertising Bureau. 2001. Internet ad revenue report, fourth quarter of 2000. http://www.iab.net/forms/qreport.html.
18. Kumar, S., V. Jacob, C. Sriskandarajah. 2000. Scheduling advertisements on a web page to maximize space utilization. Working paper, School of Management, The University of Texas at Dallas, Richardson, TX.
19. LINDO Systems, Inc. 2001. UNDO Callable Library User's Manual. Chicago, Illinois.
20. Martello, S., D. Pisinger, P. Toth. 2000. New trends in exact algorithms for the 0-1 knapsack problem. Eur. J. Oper. Res. 123 325-332.
21. Martin. R. 1999. Large Scale Linear and Integer Programming: A Unified Approach. Kluwer Academic Press, Boston, MA.
22. Nemhauser, G., L. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics and Optimization, New York.
23. Pinedo, M. 1995. Scheduling Theory, Algorithms and Systems. Prentice Hall, Englewood Cliffs, NJ.
24. Pisinger, D. 1997. A minimal algorithm for the 0-1 knapsack problem. Oper. Res. 45 758-767.
25. Schrijver, A. 1986. Theory of Linear and Integer Programming. John Wiley & Sons, New York.
26. Vance, P. 1998. Branch-and-price algorithms for the one-dimensional cutting stock problem. Comput. Optim. Appl. 9 211-228.
27. Vanderbeck, F. 1994. Decomposition and Column Generation for Integer Programs. Ph.D. thesis, Université catholique de Louvain, Louvain-la-Neuve, Belgium.