Complexity of discrete multicriteria problems

DOI10.1515/dma.1994.4.2.89zbMath0826.90122OpenAlexW2039678586MaRDI QIDQ4836160

V. A. Perepelitsa, Vladimir A. Emelichev

Publication date: 20 June 1995

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1994.4.2.89

zbMATH Keywords

vector optimization

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (6)

Problems of discrete optimization: challenges and main approaches to solve them ⋮ Solving a bicriteria problem of optimal service centers location ⋮ Conditions of solvability of vector problems using linear convolution of criteria ⋮ Asymptotic optimality of a transport-problem plan constructed by the minimum-element method ⋮ On complete and quasi-complete two-criteria optimization problems on graphs ⋮ Solvability of the vector problem by the linear criteria convolution algorithm

Cites Work

• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems
• Topics of polyhedral combinatorics in transportation problems with exclusions

This page was built for publication: Complexity of discrete multicriteria problems