On cardinality of the set of alternatives in discrete many-criterion problems
From MaRDI portal
Publication:3980659
DOI10.1515/dma.1992.2.5.461zbMath0787.90085MaRDI 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
combinatorial problems; travelling salesman; graph covering; perfect matching; set of Pareto optimal solutions; alternative set
90C35: Programming involving graphs or networks
90C29: Multi-objective and goal programming
90C27: Combinatorial optimization
Related Items
Approximation Methods for Multiobjective Optimization Problems: A Survey, 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, On local optima in multiobjective combinatorial optimization problems