On cardinality of the set of alternatives in discrete many-criterion problems

DOI10.1515/dma.1992.2.5.461zbMath0787.90085OpenAlexW2038479752MaRDI QIDQ3980659

V. A. Perepelitsa, Vladimir A. Emelichev

Publication date: 26 June 1992

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

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

zbMATH Keywords

combinatorial problemstravelling salesmangraph coveringperfect matchingset of Pareto optimal solutionsalternative set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (5)

Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ On local optima in multiobjective combinatorial optimization problems ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ Interval-parameter optimization problems on graphs ⋮ Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios

This page was built for publication: On cardinality of the set of alternatives in discrete many-criterion problems