Algorithms for Solving Lexicographic Multicriterion Problems on Matroids

  • Authors:

  • A. B. Boronin;O. Yu. Pershin

  • Affiliations:

  • V. A. Trapeznikov Institute of Control Problems, Russian Academy of Sciences, Moscow, Russia andrey@petrocom-jv.ru;V. A. Trapeznikov Institute of Control Problems, Russian Academy of Sciences, Moscow, Russia pershino@ipu.rssi.ru

  • Venue:
  • Cybernetics and Systems Analysis
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.