Advances in Business Analytics at HP Laboratories

  • Business Optimization Lab, HP Labs, Hewlett-Packard
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 148)


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.


Supply Chain Lagrangian Relaxation Product Portfolio Customer Segment Bipartite Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

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.


  1. 1.
    Ahuja RK, Orlin RB, Stein C, Tarjan RE (1994) Improved algorithms for bipartite network flow. SIAM Journal of Computing 23:903–933CrossRefGoogle Scholar
  2. 2.
    Ansari A, Mela CF (2003) E-customization. Journal of Marketing Research XL:131–145Google Scholar
  3. 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
  4. 4.
    Balinski ML (1970) On a selection problem. Management Science 17(3):230–231CrossRefGoogle Scholar
  5. 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. 6.
    Blattberg RC, Kim P, Neslin S (2008) Database marketing: Analyzing and managing customers. Springer, New YorkGoogle Scholar
  7. 7.
    Breiman L, Friedman J, Olshen R, Stone C (1984) Classification and regression trees. Chapman and Hall, New YorkGoogle Scholar
  8. 8.
    Brier, GW (1950) Verification of forecasts expressed in terms of probability. Mon. Wea. Rev., 78:1–3CrossRefGoogle Scholar
  9. 9.
    Burman M, Gershwin SB, Suyematsu C (1998) Hewlett-Packard uses operations research to improve the design of a printer production line. Interfaces 28:24–36CrossRefGoogle Scholar
  10. 10.
    Donkers B, Franses PH, Verhoef PC (2003) Selective sampling for binary choice models. Journal of Marketing Research XL:492–497Google Scholar
  11. 11.
    Ford LR, Fulkerson DR (1956) Maximum flow through a network. Canadian Journal of Mathematics 8:339–404Google Scholar
  12. 12.
    Gallo G, Grigoriadis MD, Tarjan RE (1989) A fast parametric maximum flow algorithm and applications. SIAM Journal of Computing 18:30–55CrossRefGoogle Scholar
  13. 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
  14. 14.
    Guide Jr VDR, Mulydermans L, Van Wassenhove LN (2005) Hewlett-Packard company unlocks the value potential from time-sensitive returns. Interfaces 35:281–293CrossRefGoogle Scholar
  15. 15.
    Jain S (2008) Decision sciences—A story of excellence at Hewlett-Packard. OR/MS Today, AprilGoogle Scholar
  16. 16.
    Kamakura WA, Mela CF, Ansari A, Bodapati A, Fader P, Iyengar R, Naik P, Neslin S, Sun B, Verhoef P, Wedel M, Wilcox R (2005) Choice models and customer relationship management. Marketing Letters 16(3/4):279–291CrossRefGoogle Scholar
  17. 17.
    Kamakura WA, Russell GJ (1989) A probabilistic choice model for market segmentation and elasticity structure. Journal of Marketing Research 26(4):379–390CrossRefGoogle Scholar
  18. 18.
    King G, Zeng L (2001) Logistic regression in rare events data. Political Analysis 9(2):137–163Google Scholar
  19. 19.
    Laval C, Feyhl M, Kakouros S (2005) Hewlett-Packard combined or and expert knowledge to design its supply chains. Interfaces 35:238–247CrossRefGoogle Scholar
  20. 20.
    Lee HL, Billington C (1995) The evolution of supply chain management models and practice at Hewlett-Packard company. Interfaces 25:42–46CrossRefGoogle Scholar
  21. 21.
    Manski CF, Lerman SR (1977) The estimation of choice probabilities from choice based samples. Econometrica 45(8)(November):1977–1988CrossRefGoogle Scholar
  22. 22.
    Manski CF, McFadden D (1981) Structural analysis of discrete data with econometric applications. MIT, Cambridge, MAGoogle Scholar
  23. 23.
    McFadden D (1996) On the analysis of “Intercept and Follow” surveys. Working Paper. University of California, Berkeley, CAGoogle Scholar
  24. 24.
    Naik PA, Tsai CL (2004) Isotonic single-index model for high-dimensional database marketing. Computational Statistics & Data Analysis 47(4):775–790CrossRefGoogle Scholar
  25. 25.
    Rhys JMW (1970) A selection problem of shared fixed costs and network flows. Management Science 17(3):200–207CrossRefGoogle Scholar
  26. 26.
    Rossi PE, McCulloch RE, Allenby GM (1996) The value of purchase history data in target marketing. Marketing Science 15(4):321–340.CrossRefGoogle Scholar
  27. 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. 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. 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. 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. 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. 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

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Business Optimization Lab, HP Labs, Hewlett-Packard
    • 1
  1. 1.Palo AltoUSA

Personalised recommendations