Skip to main content
SpringerLink
Log in

Algorithms for Solving Lexicographic Multicriterion Problems on Matroids

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Algorithms for lexicographic multicriterion problems on matroids and multicriterion problems solved by the concession method are described. The algorithms are based on the polynomial procedure of finding a sequence of the best solutions to an extremum problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. O. Yu. Pershin, “A polynomial algorithm for deriving a given number of the best solutions in extremum problems on matroids,” Avtom. Telemekh., No. 10, 148–154 (1999).

    Google Scholar 

  2. M. Gary and D. Johnson, Computers and Hard to Solve Problems [Russian translation], Mir, Moscow (1982).

    Google Scholar 

  3. I. V. Sergienko and V. A. Perepelitsa, “Finding the set of alternatives in discrete multicriterion problems,” Kibernetika, No. 5, 85–93 (1987).

    Google Scholar 

  4. V. A. Emelichev and M. K. Kravtsov, “Completeness of vector discrete optimization problems,” Kibern. Sist. Analiz, No. 5, 75–83 (1994).

    Google Scholar 

  5. V. A. Emelichev and M. K. Kravtsov, “Combinatorial problems of vector optimization,” Diskr., Mat., No. 7, 3–18 (1995).

    Google Scholar 

  6. H. Papadimitriu and K. Stayglitz, Combinatory Optimization: Algorithms and Complexity [Russian translation], Mir, Moscow (1985).

    Google Scholar 

  7. V. V. Podinovskii and V. M. Gavrilov, Optimization on Sequentially Applied Criteria [in Russian], Sov. Radio, Moscow (1975).

    Google Scholar 

  8. J. B. Kruskal, “On the shortest spanning subtree of a graph and the traveling salesman problem,” Proc. Amer. Math. Soc., No. 7, 48–50 (1956).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. A. Trapeznikov Institute of Control Problems, Russian Academy of Sciences, Moscow, Russia

    A. B. Boronin & O. Yu. Pershin

Authors
  1. A. B. Boronin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. Yu. Pershin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Boronin, A.B., Pershin, O.Y. Algorithms for Solving Lexicographic Multicriterion Problems on Matroids. Cybernetics and Systems Analysis 40, 363–369 (2004). https://doi.org/10.1023/B:CASA.0000041993.34948.de

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:CASA.0000041993.34948.de

Search

Navigation