Improving Web-Catalog Design for Easy Product Search

Published Online:https://doi.org/10.1287/ijoc.1060.0184

References

  • Adamic L. A., Lukose R. M., Puniyani A. R., Huberman B. A. Search in power-law networks. Physical Rev. E (2001) 64:046135CrossrefGoogle Scholar
  • Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Inc., Englewood Cliffs, NJ) Google Scholar
  • Aladwani A. M., Palvia P. C. Developing and validating an instrument for measuring user-perceived web quality. Inform. Management (2002) 39:467–476CrossrefGoogle Scholar
  • Anderson M., Ball M., Boley H., Greene S., Howse N., Lemire D., McGrath S. RACOFI: Rule-applying collaborative filtering systems. Proc. IEEE/WIC COLA'03 (2003) Halifax, Canada:13–23Google Scholar
  • Bhargava H. K., Sun D., Xu S. H. Stockout compensation: Joint inventory and price optimization in electronic retailing. INFORMS J. Comput. (2006) 18:255–266LinkGoogle Scholar
  • Brown E. Slow road to fast data. Fortune (2002) March 18). http://money.cnn.com/magazines/fortune/fortune_archive/2002/03/18/319878Google Scholar
  • Chambers L.Practical Handbook of Genetic Algorithms: Applications (1995) 1(CRC Press, Boca Raton, FL) CrossrefGoogle Scholar
  • Cormen T., Leiserson C., Rivest R.Introduction to Algorithms (2000) (MIT Press, Cambridge, MA) Google Scholar
  • Deo N., Gupta P. Sampling the web with random walks. Congressus Numerantium, 149. 32nd Southeastern Internat. Conf. Combinatorics, Graph Theory and Comput. (2001) Baton Rouge, LA:143–154Google Scholar
  • Deo N., Gupta P. Graph-theoretic analysis of the World Wide Web: New directions and challenges. Mathematica Contomporanea, Sociedade Brasileira de Matemática (2003) 25:49–69Google Scholar
  • Drezner Z. A new genetic algorithm for the quadratic assignment problem. INFORMS J. Comput. (2003) 15:320–330LinkGoogle Scholar
  • Drezner Z., Salhi S. Using hybrid metaheuristics for the one-way and two-way network design problem. Naval Res. Logist. (2002) 49:449–463CrossrefGoogle Scholar
  • Economist, The E-commerce: Profits at last. The Economist (2002) December 19):95–96Google Scholar
  • Garey M. R., Johnson D. S.Computers and Intractability (1979) (Freeman, New York) Google Scholar
  • Golub G. H., Van Loan C. F.Matrix Computations (1997) 3rd ed.(The Johns Hopkins University Press, Baltimore, MD) Google Scholar
  • Hoffman W., Keedy J., Roberts K. The unexpected return of B2B. The McKinsey Quarterly (2002) 3). http://www.mckinseyquarterly.comGoogle Scholar
  • Hong W., Thong J. Y. L., Tam K. Y. Does animation attract online users' attention? The effects of flash on information search performance and perceptions. Inform. Systems Res. (2004) 15:60–86LinkGoogle Scholar
  • Hurst M. Building a great customer experience to develop brand, increase loyalty and grow revenues. (1999) . White Paper One, Creative Good, Inc., http://www.creativegood.comGoogle Scholar
  • Karuga G. G., Khraban A. M., Nair S. K., Rice D. O. AdPalette: An algorithm for customizing online advertisements on the fly. Decision Support Systems (2001) 32:85–106CrossrefGoogle Scholar
  • Koopmans T., Beckmann M. Assignment problems and the location of economic activities. Econometrica (1957) 25:53–76CrossrefGoogle Scholar
  • Lv Q., Cao P., Cohen E., Li K., Shenker S. Search and replication in unstructured peer-to-peer networks. Proc. ACM ICS'02 (2002) 84–95CrossrefGoogle Scholar
  • Mathwick C., Malhotra N., Rigdon E. Experiential value: Conceptualization, measurement and application in the catalog and internet shopping environment. J. Retailing (2001) 77:39–56CrossrefGoogle Scholar
  • Michalewicz Z.Genetic Algorithms+Data Structures=Evolution Programs (1994) 2nd ed.(Springer, New York) CrossrefGoogle Scholar
  • Mullaney T. J. E-biz strikes again! Business Week (2004) May 10):80–81Google Scholar
  • Mullaney T. J., Green H., Arndt M., Hof R. D., Himelstein L. The e-biz surprise. Business Week (2003) May 12):60–66Google Scholar
  • Muralidhar K., Sarathy R., Parsa R. An improved security requirement for data perturbation with implications for e-commerce. Decision Sci. (2001) 32:683–698CrossrefGoogle Scholar
  • Nua Internet Surveys How many online? Nua Internet Surveys (2003) . http://www.nua.com/surveys/how_many_onlineGoogle Scholar
  • Norman K. L.The Psychology of Menu Selection (1991) (Ablex, Norwood, NJ) Google Scholar
  • Padmanabhan B., Tuzhilin A. On the use of optimization for data mining: Theoretical interactions and eCRM opportunities. Management Sci. (2003) 49:1327–1343LinkGoogle Scholar
  • Rosen C. Amazon's alliances. Information Week (2001) June 4). http://informationweek.com/840/amz_online.htmGoogle Scholar
  • Sarwar B., Karypis G., Konstan J., Riedl J. Item based collaborative filtering recommendation algorithms. Proc. WWW10 Conf. (2001) . http://www10.org/cdrom/papers/contents.htmlCrossrefGoogle Scholar
  • Schaffer E., Sorflaten J. Key tips for user-centered design. Human Factors International (2004) . http://www.humanfactors.com/downloads/keytips.aspGoogle Scholar
  • Schlosser J. Looking for intelligence in ice cream: Companies have mastered collecting information, but not what to do with it. Fortune (2003) March 17). http://money.cnn.com/magazines/fortune/fortune_archive/2003/03/17/339261Google Scholar
  • Tan Q. Z., Chai X. Y., Ng W., Lee D. L. Applying co-training to clickthrough data for search engine adaptation. Lecture Notes in Computer Science (2004) 2973(Springer, Berlin, Germany) 519–532CrossrefGoogle Scholar
  • Tan Y., Moinzadeh K., Mookerjee V. Optimal processing policies for an e-commerce web server. INFORMS J. Comput. (2005) 17:99–110LinkGoogle Scholar
  • Tedeschi R. As the holidays approach, online retailers seek to spiff up their sites and minimize consumer frustation. The New York Times (2003) October 27):C6–C7Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.