On complete and quasi-complete two-criteria optimization problems on graphs

DOI10.1007/s10559-018-0040-1zbMath1401.90212OpenAlexW2803565429WikidataQ129792152 ScholiaQ129792152MaRDI QIDQ1795505

V. A. Perepelitsa, E. V. Tereschenko

Publication date: 16 October 2018

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

Full work available at URL: https://doi.org/10.1007/s10559-018-0040-1

zbMATH Keywords

vector optimizationmulticriteria optimizationcomplete problemPareto setcomplete set of alternativesquasi-complete problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions (49K99)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding the set of alternatives in discrete multicriterion problems
• Complexity of discrete multicriteria problems

This page was built for publication: On complete and quasi-complete two-criteria optimization problems on graphs