IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v25y1979i12p1197-1207.html
   My bibliography  Save this article

An Optimal Algorithm for Sales Representative Time Management

Author

Listed:
  • Andris A. Zoltners

    (Northwestern University)

  • Prabhakant Sinha

    (University of Georgia)

  • Philip S. C. Chong

    (North Dakota State University)

Abstract

This paper addresses the time management problem confronted by sales representatives. The sales representative planning his itinerary must decide the best way to ration time among the accounts comprising his territory. The time management problem is formulated as an integer program whereby each admissible call frequency for each account is represented by a zero-one decision variable. A branch-and-bound integer programming algorithm for this problem is presented. The algorithm is unique in that two integer programming formulations of the problem are used simultaneously in the search procedure and an approximation-cum-relaxation is evaluated at each branch in the search. Computational testing of the algorithm shows that it can solve many realistic time management problems optimally in fractions of a second.

Suggested Citation

  • Andris A. Zoltners & Prabhakant Sinha & Philip S. C. Chong, 1979. "An Optimal Algorithm for Sales Representative Time Management," Management Science, INFORMS, vol. 25(12), pages 1197-1207, December.
  • Handle: RePEc:inm:ormnsc:v:25:y:1979:i:12:p:1197-1207
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.25.12.1197
    Download Restriction: no

    Citations

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


    Cited by:

    1. AgralI, Semra & Geunes, Joseph, 2009. "Solving knapsack problems with S-curve return functions," European Journal of Operational Research, Elsevier, vol. 193(2), pages 605-615, March.
    2. repec:kap:qmktec:v:15:y:2017:i:1:d:10.1007_s11129-016-9177-2 is not listed on IDEAS
    3. Andreas Drexl & Knut Haase, 1999. "Fast Approximation Methods for Sales Force Deployment," Management Science, INFORMS, vol. 45(10), pages 1307-1323, October.

    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:ormnsc:v:25:y:1979:i:12:p:1197-1207. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .

    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.

    We have no references for this item. You can help adding them by using 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.