Advances in Business Analytics at HP Laboratories
HP Labs’ Business Optimization Lab is a group of researchers focused on developing innovations in business analytics that deliver value to HP. This chapter describes several activities of the Business Optimization Lab, including work in product portfolio management, prediction markets, modeling of rare events in marketing, and supply chain network design.
Unable to display preview. Download preview PDF.
In this chapter, we have summarized the work of several members of the HP Labs and business units of HP. In particular, we are very thankful to Kemal Guler for organizing the content of distribution network design portion of this chapter.
- 2.Ansari A, Mela CF (2003) E-customization. Journal of Marketing Research XL:131–145Google Scholar
- 3.Babenko M, Derryberry J, Goldberg A, Tarjan R, Zhou Y (2007) Experimental evaluation of parametric max-flow algorithms. Proceedings of WEA. Lecture Notes in Computer Science 4525. Springer, Berlin–Heidelberg, Germany, pp. 612–623Google Scholar
- 5.Beyer D, Ward J (2002) Network server supply chain at HP: A case study. In: Song J, Yao D (eds) Supply chain structures: Coordination, information and optimization. International Series in Operations Research and Management Science, Kluwer, Norwell, MAGoogle Scholar
- 6.Blattberg RC, Kim P, Neslin S (2008) Database marketing: Analyzing and managing customers. Springer, New YorkGoogle Scholar
- 7.Breiman L, Friedman J, Olshen R, Stone C (1984) Classification and regression trees. Chapman and Hall, New YorkGoogle Scholar
- 10.Donkers B, Franses PH, Verhoef PC (2003) Selective sampling for binary choice models. Journal of Marketing Research XL:492–497Google Scholar
- 11.Ford LR, Fulkerson DR (1956) Maximum flow through a network. Canadian Journal of Mathematics 8:339–404Google Scholar
- 13.Goldberg AV, Tarjan RE (1986) A new approach to the maximum flow problem. Proceedings of the 18th Annual ACM Sympos Theory Computation (Berkeley, CA), May 28–30, pp. 136–146Google Scholar
- 15.Jain S (2008) Decision sciences—A story of excellence at Hewlett-Packard. OR/MS Today, AprilGoogle Scholar
- 18.King G, Zeng L (2001) Logistic regression in rare events data. Political Analysis 9(2):137–163Google Scholar
- 22.Manski CF, McFadden D (1981) Structural analysis of discrete data with econometric applications. MIT, Cambridge, MAGoogle Scholar
- 23.McFadden D (1996) On the analysis of “Intercept and Follow” surveys. Working Paper. University of California, Berkeley, CAGoogle Scholar
- 27.Scott AJ, Wild CJ (1986) Fitting logistic models under case-control or choice based sampling. Journal of the Royal Statistical Society 48(2):170–182Google Scholar
- 28.Tarjan R, Ward J, Zhang B, Zhou Y, Mao J (2006) Balancing applied to maximum network flow problems. Proceedings of the ESA, Lecture Notes in Computer Science 4168, pp. 612–623Google Scholar
- 29.Ward J, Zhang B, Jain S, Fry C, Olavson T, Mishal H, Amaral J, Beyer D, Brecht A, Cargille B, Chadinha R, Chou K, DeNyse G, Feng Q, Padovani C, Raj S, Sunderbruch K, Tarjan R, Venkatraman K, Woods J, Zhou J (2010) HP transforms product portfolio management with operations research. Interfaces 40(1):17–32CrossRefGoogle Scholar
- 30.Zhang B, Ward J, Feng Q (2004) A simultaneous parametric maximum flow algorithm for finding the complete chain of solutions. HP Technical Report: HPL-2004-189, Palo Alto, CAGoogle Scholar
- 31.Zhang B, Ward J, Feng Q (2005a) Simultaneous parametric maximum flow algorithm for the selection model. HP Technical Report HPL-2005-91, Palo Alto, CAGoogle Scholar
- 32.Zhang B, Ward J, Feng Q (2005b) Simultaneous parametric maximum flow algorithm with vertex balancing, HP Technical Report HPL-2005-121, Palo Alto, CAGoogle Scholar