Logo Logo

An Optimal Algorithm for Sales Representative Time Management, Management Science

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 integr programming formulations of the problem are used simultaneously in the search procedure and an approximation-cumrelaxation 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.

Type

Article

Author(s)

Andris Zoltners, Prabhakant Sinha, Philip S.C Chong

Date Published

1979

Citations

Zoltners, Andris, Prabhakant Sinha, and Philip S.C Chong. 1979. An Optimal Algorithm for Sales Representative Time Management. Management Science. 25(12): 1197-1207.

KELLOGG INSIGHT

Explore leading research and ideas

Find articles, podcast episodes, and videos that spark ideas in lifelong learners, and inspire those looking to advance in their careers.
learn more

COURSE CATALOG

Review Courses & Schedules

Access information about specific courses and their schedules by viewing the interactive course scheduler tool.
LEARN MORE

DEGREE PROGRAMS

Discover the path to your goals

Whether you choose our Full-Time, Part-Time or Executive MBA program, you’ll enjoy the same unparalleled education, exceptional faculty and distinctive culture.
learn more