HP Transforms Product Portfolio Management with Operations Research

References

• Ahuja R. K., Orlin J. B., Stein C., Tarjan R. E. Improved algorithms for bipartite network flow. SIAM J. Comput. (1994) 23(5):906–933Crossref, Google Scholar
• Babenko M., Derryberry J., Goldberg A., Tarjan R., Zhou Y., Demetrescu C. Experimental evaluation of parametric max-flow algorithms. Proc. WEA 2007 (2007) 4525(Springer, Heidelberg, Germany) 256–269Lecture Notes in Computer ScienceCrossref, Google Scholar
• Balinksi M. L. On a selection problem. Management Sci. (1970) 17(3):230–231Link, Google Scholar
• Cargille B., Melia J. Less is more, later is better: Keeping sales high and costs low at Hewlett-Packard. APICS (2007) October 7):40–43Google Scholar
• Cargille B., Fry C., Raphel A. Managing product line complexity. OR/MS Today (2005) 32(3). http://www.lionhrtpub.com/orms/orms-6-05/frcomplexity.htmlGoogle Scholar
• Ford L. R., Fulkerson D. R. Maximum flow through a network. Canadian J. Math. (1956) 8:339–404Crossref, Google Scholar
• Gallo G., Grigoriadis M. D., Tarjan R. E. A fast parametric maximum flow algorithm and applications. SIAM J. Comput. (1989) 18(1):30–55Crossref, Google Scholar
• Goldberg A. V., Tarjan R. E. A new approach to the maximum flow problem. Proc. 18th Annual ACM Sympos. Theory Comput. (1986) Berkeley, CA(ACM, New York) 136–146Google Scholar
• Goldberg A. V., Tarjan R. E. A new approach to the maximum flow problem. J. ACM (1988) 35(4):921–940Crossref, Google Scholar
• Jain S. Decision sciences: A story of excellence at Hewlett-Packard. OR/MS Today (2008) 35(2). http://www.lionhrtpub.com/orms/orms-4-08/frroundtable.htmlGoogle Scholar
• Olavson T., Cargille B. OR inside. OR/MS Today (2008) 35(5). http://www.lionhrtpub.com/orms/orms-10-08/franalytics.htmlGoogle Scholar
• Olavson T., Fry C. Understanding the dynamics of value driven variety management. MIT Sloan Management Rev. (2006) 48(1):63–69Google Scholar
• Rhys J. M. W. A selection problem of shared fixed costs and network flows. Management Sci. (1970) 17(3):200–207Link, Google Scholar
• Silver E. A., Pyke D. F., Peterson R.Inventory Management and Production Planning and Scheduling (1998) (John Wiley & Sons, New York) Google Scholar
• Tarjan R., Ward J., Zhang B., Zhou Y., Mao J. Balancing applied to maximum network flow problems. Proc. 14th Conf. Ann. Eur. Sympos. ESA (2006) 4168(Springer, Heidelberg, Germany) 612–623Lecture Notes in Computer ScienceGoogle Scholar
• Zhang B., Ward J., Feng Q. A simultaneous parametric maximum flow algorithm for finding the complete chain of solutions. (2004) . HP Technical Report HPL-2004-189, Palo Alto, CAGoogle Scholar
• Zhang B., Ward J., Feng Q. Simultaneous parametric maximum flow algorithm for the selection model. (2005a) . HP Technical Report HPL-2005-91, Palo Alto, CAGoogle Scholar
• Zhang B., Ward J., Feng Q. Simultaneous parametric maximum flow algorithm with vertex balancing. (2005b) . HP Technical Report HPL-2005-121, Palo Alto, CAGoogle Scholar