We address the problem of moving a collection of objects from one subset of Zm to another at minimum cost. We show that underfairly natural rules for movement assumptions, if the origin and destination are far enough apart, then a near optimal solution with special structure exists: Our trajectory from the originto the destination accrues almost all of its cost repeatingat most m different patterns of movement. Directions for related research are identified.
© 1990 INFORMS
Benjamin, Arthur T. "Graphs, maneuvers and turnpikes." Oper Res. 38.2 (1990): 202-216. DOI: 10.1287/opre.38.2.202