On combinatorial vector optimization problems

DOI10.1515/dma.1995.5.2.93zbMath0839.90095OpenAlexW2024864677MaRDI QIDQ4856879

M. K. Kravtsov, Vladimir A. Emelichev

Publication date: 28 January 1996

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

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

zbMATH Keywords

pathsvector optimizationmatchingsspanning treesinteger transportation problem

Mathematics Subject Classification ID

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

Related Items (4)

Unnamed Item ⋮ On five types of stability of the lexicographic variant of the combinatorial bottleneck problem ⋮ Solvability of the vector problem by the linear criteria convolution algorithm ⋮ Stability, pseudostability, and quasistability of a multicriterial problem on a system of subsets

This page was built for publication: On combinatorial vector optimization problems