IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v35y1987i1p70-79.html
   My bibliography  Save this article

Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems

Author

Listed:
  • Arthur Warburton

    (University of Ottawa, Ontario, Canada)

Abstract

We study methods for approximating the set of Pareto optimal paths in multiple-objective, shortest-path problems. Known generalizations of standard shortest-path methods will compute this set, but can suffer from rapidly increasing computational and storage demands as problem size increases. In an effort to avoid such difficulties, we develop approximation methods that can estimate the Pareto optima to any required degree of accuracy. The approximation methods are “fully polynomial”; that is, they operate in time and space bounded by a polynomial in problem size and accuracy of approximation—the greater the accuracy, the more time required to reach a solution. We show how approximation methods may be applied to yield fully polynomial approximation schemes for a variety of NP-complete, single-objective problems.

Suggested Citation

  • Arthur Warburton, 1987. "Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems," Operations Research, INFORMS, vol. 35(1), pages 70-79, February.
    • Handle: RePEc:inm:oropre:v:35:y:1987:i:1:p:70-79
    DOI: 10.1287/opre.35.1.70
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.35.1.70
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.35.1.70?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:oropre:v:35:y:1987:i:1:p:70-79. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.