Graphs, Maneuvers and Turnpikes

Arthur T. Benjamin
Additional contact information
Arthur T. Benjamin: Harvey Mudd College, Claremont, California

Operations Research, 1990, vol. 38, issue 2, 202-216

Abstract: We address the problem of moving a collection of objects from one subset of Z m to another at minimum cost. We show that under fairly 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 origin to the destination accrues almost all of its cost repeating at most m different patterns of movement. Directions for related research are identified.

Keywords: military; logistics; optimal maneuvering; networks/graphs; optimal maneuvering by graph theory approach; transportation; mode/route choice; optimal maneuvering by turnpike theorems (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.2.202 (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:oropre:v:38:y:1990:i:2:p:202-216

Access Statistics for this article

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