Note: Some Remarks on the Paper by J. Telgen, “How to Schedule Meetings with a Traveling Salesman Q & D, and Why We Didn't”

Gerard Sierksma
Additional contact information
Gerard Sierksma: University of Groningen, Institute of Econometrics, Operations Research Section, P.O. Box 800, Groningen, The Netherlands

Interfaces, 1988, vol. 18, issue 2, 105-107

Abstract: It was a pity for the manager Mr. Jenson that the young management trainee Tom did not offer him the optimal solution for the meetings scheduling problem that bothered Mr. Jensen so much. Below, three possible optimal solutions are offered using Apex, the cheapest insertion rule, and the three-Opt heuristic.Response from J. Telgen, author of the original paper, follows.

Keywords: networks/graphs: traveling salesman; organizational studies: leadership (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/inte.18.2.105 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:orinte:v:18:y:1988:i:2:p:105-107

Access Statistics for this article

More articles in Interfaces from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().