IDEAS home Printed from https://ideas.repec.org/a/inm/ormksc/v20y2001i4p364-372.html
   My bibliography  Save this article

The History of the Marketing College Is a Work in Progress

Author

Listed:
  • John D. C. Little

    (MIT Sloan School, 38 Memorial Drive, Cambridge, Massachusetts 02142)

Abstract

No abstract available

Suggested Citation

  • John D. C. Little, 2001. "The History of the Marketing College Is a Work in Progress," Marketing Science, INFORMS, vol. 20(4), pages 364-372.
    • Handle: RePEc:inm:ormksc:v:20:y:2001:i:4:p:364-372
    DOI: 10.1287/mksc.20.4.364.9752
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mksc.20.4.364.9752
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mksc.20.4.364.9752?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Frank M. Bass, 2001. "Some History of the TIMS/INFORMS College on Marketing as Related to the Development of Marketing Science," Marketing Science, INFORMS, vol. 20(4), pages 360-363.
    2. Dick R. Wittink, 2001. "Market Measurement and Analysis: The First “Marketing Science” Conference," Marketing Science, INFORMS, vol. 20(4), pages 349-356.
    3. Lewis G. Pringle, 2001. "The Academy and The Practice: In Principle, Theory and Practice Are Different. But, in Practice, They Never Are," Marketing Science, INFORMS, vol. 20(4), pages 373-381.
    4. David B. Montgomery, 2001. "Management Science in Marketing: Prehistory, Origin, and Early Years of the INFORMS Marketing College," Marketing Science, INFORMS, vol. 20(4), pages 337-348.
    5. John D. C. Little & Katta G. Murty & Dura W. Sweeney & Caroline Karel, 1963. "An Algorithm for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 11(6), pages 972-989, December.
    6. John F. Magee, 1953. "The Effect of Promotional Effort on Sales," Operations Research, INFORMS, vol. 1(2), pages 64-74, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Donald G. Morrison & Jagmohan S. Raju, 2004. "50th Anniversary Article: The Marketing Department in Management Science: Its History, Contributions, and the Future," Management Science, INFORMS, vol. 50(4), pages 425-428, April.
    2. Frank M. Bass, 2001. "Some History of the TIMS/INFORMS College on Marketing as Related to the Development of Marketing Science," Marketing Science, INFORMS, vol. 20(4), pages 360-363.
    3. Dick R. Wittink, 2001. "Market Measurement and Analysis: The First “Marketing Science” Conference," Marketing Science, INFORMS, vol. 20(4), pages 349-356.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Frank M. Bass, 2001. "Some History of the TIMS/INFORMS College on Marketing as Related to the Development of Marketing Science," Marketing Science, INFORMS, vol. 20(4), pages 360-363.
    2. Dick R. Wittink, 2001. "Market Measurement and Analysis: The First “Marketing Science” Conference," Marketing Science, INFORMS, vol. 20(4), pages 349-356.
    3. Guo, Chiquan, 2004. "Marketing research: Cui bono?," Business Horizons, Elsevier, vol. 47(5), pages 33-38.
    4. José Berenguel & L. Casado & I. García & Eligius Hendrix, 2013. "On estimating workload in interval branch-and-bound global optimization algorithms," Journal of Global Optimization, Springer, vol. 56(3), pages 821-844, July.
    5. N. Kazazakis & C. S. Adjiman, 2018. "Arbitrarily tight $$\alpha $$ α BB underestimators of general non-linear functions over sub-optimal domains," Journal of Global Optimization, Springer, vol. 71(4), pages 815-844, August.
    6. Donald G. Morrison & Jagmohan S. Raju, 2004. "50th Anniversary Article: The Marketing Department in Management Science: Its History, Contributions, and the Future," Management Science, INFORMS, vol. 50(4), pages 425-428, April.
    7. Joaquín Antonio Pacheco Bonrostro, 1995. "Problemas de rutas con carga y descarga en sistemas lifo: soluciones exactas," Estudios de Economia Aplicada, Estudios de Economia Aplicada, vol. 3, pages 69-86, Junio.
    8. Tomáš Režnar & Jan Martinovič & Kateřina Slaninová & Ekaterina Grakova & Vít Vondrák, 2017. "Probabilistic time-dependent vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(3), pages 545-560, September.
    9. Bogna MRÓWCZYŃSKA, 2015. "Multicriteria vehicle routing problem solved by artificial immune system," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 10(3), pages 141-152, September.
    10. Edward I. Brody, 2001. "Marketing Engineering at BBDO," Interfaces, INFORMS, vol. 31(3_supplem), pages 74-81, June.
    11. Michael Windham & J. Hutchinson & Shizuhiko Nishisato & Ludovic Lebart & George Furnas & Richard Dubes & Frank Critchley & A. Gordon & Fionn Murtagh & Ulf Bockenholt & Philip Hopke & Daniel Wartenberg, 1988. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 5(1), pages 105-154, March.
    12. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
    13. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    14. Zhang Yang & Jiacheng Li & Lei Li, 2020. "Time-Dependent Theme Park Routing Problem by Partheno-Genetic Algorithm," Mathematics, MDPI, vol. 8(12), pages 1-20, December.
    15. Lawrence Hubert & Frank Baker, 1978. "Applications of combinatorial programming to data analysis: The traveling salesman and related problems," Psychometrika, Springer;The Psychometric Society, vol. 43(1), pages 81-91, March.
    16. A. S. Santos & A. M. Madureira & M. L. R. Varela, 2018. "The Influence of Problem Specific Neighborhood Structures in Metaheuristics Performance," Journal of Mathematics, Hindawi, vol. 2018, pages 1-14, July.
    17. Gilbert Laporte, 2009. "Fifty Years of Vehicle Routing," Transportation Science, INFORMS, vol. 43(4), pages 408-416, November.
    18. Ohashi, Kazumasa, 1999. "Dynamic process planning system for a machining center in an FMS environment," International Journal of Production Economics, Elsevier, vol. 60(1), pages 457-464, April.
    19. Luminiţa Nicolescu & Cristina Galalae & Alexandru Voicu, 2013. "Solving a Supply Chain Management Problem to Near Optimality Using Ant Colony Optimization, in an International Context," The AMFITEATRU ECONOMIC journal, Academy of Economic Studies - Bucharest, Romania, vol. 15(33), pages 8-26, February.
    20. Ashayeri, J. & Selen, W., 2007. "A planning and scheduling model for onsertion in printed circuit board assembly," European Journal of Operational Research, Elsevier, vol. 183(2), pages 909-925, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormksc:v:20:y:2001:i:4:p:364-372. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.