Solvability of 3-nondegenerate discrete multicriterion problems by the scalarization algorithm

DOI10.1007/BF02366533MaRDI QIDQ1364081zbMATH OpenOpenAlexFDO

Authors V. A. Perepelitsa, L. N. Sergeeva

Publication date 24 August 1997

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02366533

zbMATH Keywords

multicriterion combinatorial optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Recommendations

• An algorithm for solving a class of discrete multicriterion problems
• scientific article; zbMATH DE number 803941
• On conditions of efficiency of a solution of a multicriteria discrete problem
• scientific article; zbMATH DE number 3982928
• Solvability of the vector problem by the linear criteria convolution algorithm

Cited in

(1)

• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems

This page was built for publication: Solvability of 3-nondegenerate discrete multicriterion problems by the scalarization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364081)