Scheduling Banner Advertisements on the Web

References

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