Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm

zbMath0834.90133MaRDI QIDQ1903927

M. K. Kravtsov, Vladimir A. Emelichev

Publication date: 1 April 1996

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

travelling salesman; perfect matchings; spanning trees; multicriterion problems on graphs

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C29: Multi-objective and goal programming

Related Items

Solvability of the vector problem by the linear criteria convolution algorithm, Stability, pseudostability, and quasistability of a multicriterial problem on a system of subsets, Conditions of solvability of vector problems using linear convolution of criteria