IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v93y2025i1d10.1007_s10898-025-01512-6.html
   My bibliography  Save this article

A survey of exact and approximation algorithms for linear-parametric optimization problems

Author

Listed:
  • Levin Nemesch

    (RPTU Kaiserslautern-Landau)

  • Stefan Ruzika

    (RPTU Kaiserslautern-Landau)

  • Clemens Thielen

    (Technical University of Munich)

  • Alina Wittmann

    (Technical University of Munich)

Abstract

Linear-parametric optimization, where multiple objectives are combined into a single objective using linear combinations with parameters as coefficients, has numerous links to other fields in optimization and a wide range of application areas. In this survey, we provide a comprehensive overview of structural results and algorithmic strategies for solving linear-parametric optimization problems exactly and approximately. Transferring concepts from related areas such as multi-objective optimization provides further relevant results. The survey consists of two parts: First, we list strategies that work in a general fashion and do not rely on specific problem structures. Second, we look at well-studied parametric optimization problems and cover both important theoretical results and specialized algorithmic approaches for these problems. Among these problems are parametric variants of shortest path problems, minimum cost flow and maximum flow problems, spanning tree problems, the knapsack problem, and matching problems. Overall, we cover the results from 128 publications (and refer to 35 supplemental works) published between 1963 and 2024.

Suggested Citation

  • Levin Nemesch & Stefan Ruzika & Clemens Thielen & Alina Wittmann, 2025. "A survey of exact and approximation algorithms for linear-parametric optimization problems," Journal of Global Optimization, Springer, vol. 93(1), pages 299-333, September.
    • Handle: RePEc:spr:jglopt:v:93:y:2025:i:1:d:10.1007_s10898-025-01512-6
    DOI: 10.1007/s10898-025-01512-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-025-01512-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-025-01512-6?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spr:jglopt:v:93:y:2025:i:1:d:10.1007_s10898-025-01512-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.